Termination proof of /tmp/tmp92lWrW/Infix2Postfix.jar

Termination of the given JBC could be proven:

0 JBC

↳1 JBC2FIG (⇒)

↳2 JBCTerminationGraph

↳3 FIGtoITRSProof (⇒)

↳4 AND

    ↳5 IDP

        ↳6 IDPtoQDPProof (⇒)

        ↳7 QDP

        ↳8 UsableRulesProof (⇔)

        ↳9 QDP

        ↳10 QReductionProof (⇔)

        ↳11 QDP

        ↳12 QDPSizeChangeProof (⇔)

        ↳13 YES

    ↳14 IDP

        ↳15 IDPNonInfProof (⇒)

        ↳16 AND

            ↳17 IDP

                ↳18 IDependencyGraphProof (⇔)

                ↳19 TRUE

            ↳20 IDP

                ↳21 IDPtoQDPProof (⇒)

                ↳22 QDP

                ↳23 UsableRulesProof (⇔)

                ↳24 QDP

                ↳25 QReductionProof (⇔)

                ↳26 QDP

                ↳27 QDPSizeChangeProof (⇔)

                ↳28 YES

    ↳29 IDP

        ↳30 IDPNonInfProof (⇒)

        ↳31 AND

            ↳32 IDP

                ↳33 IDependencyGraphProof (⇔)

                ↳34 TRUE

            ↳35 IDP

                ↳36 IDependencyGraphProof (⇔)

                ↳37 TRUE

    ↳38 IDP

        ↳39 IDPNonInfProof (⇒)

        ↳40 AND

            ↳41 IDP

                ↳42 IDependencyGraphProof (⇔)

                ↳43 TRUE

            ↳44 IDP

                ↳45 IDependencyGraphProof (⇔)

                ↳46 TRUE

(0) Obligation:

JBC Problem based on JBC Program:
Manifest-Version: 1.0 Created-By: 1.6.0_20 (Apple Inc.) Main-Class: Infix2Postfix

public class Infix2Postfix {
    public static LinkedList buildExpression(int n) {
	LinkedList exp = null;
	for (int i = 1; i <= n; i++) {
	    if (i <= n-1) exp = new LinkedList(')', exp);
	    exp = new LinkedList(')', exp);
	    exp = new LinkedList('b', exp);
	    exp = new LinkedList('+', exp);
	    exp = new LinkedList('a', exp);
	    exp = new LinkedList('(', exp);
	    if (i <= n-1) exp = new LinkedList('*', exp);
	}

	for (int i = 1; i < n; i++)
	    exp = new LinkedList('(', exp);

	return exp;
    }

    public static LinkedList toPostfix(LinkedList infix) {
	LinkedList operators = null, operands = null;
	while (infix != null) {
	    char c = infix.getFirst();
	    switch (c) {
	    case '(': break;
	    case '+': case '-': case '*': case '/':
		operators = new LinkedList(c, operators);
		break;
	    case ')':
		operands = new LinkedList(operators.getFirst(), operands);
		operators = operators.getTail();
		break;
	    default:
		operands = new LinkedList(c, operands);
	    }
	    infix = infix.getTail();
	}

	LinkedList postfix = null;
	while (operands != null) {
	    postfix = new LinkedList(operands.getFirst(), postfix);
	    operands = operands.getTail();
	}

	return postfix;
    }

    public static void  main(String args[]) {
	LinkedList infix = buildExpression(args.length);
	// System.out.println("infix = " + infix);
	LinkedList postfix = toPostfix(infix);
	// System.out.println("postfix = " + postfix);
    }
}


public class LinkedList {
    private char head;
    private LinkedList tail;

    public LinkedList(char head, LinkedList tail) {
	this.head = head;
	this.tail = tail;
    }

    public char getFirst() {
	return this.head;
    }

    public LinkedList getTail() {
	return this.tail;
    }

    /*
    public String toString() {
	return head + (tail == null ? "" : " " + tail.toString());
    }
    */
}

(1) JBC2FIG (SOUND transformation)

Constructed FIGraph.

(2) Obligation:

FIGraph based on JBC Program:
Infix2Postfix.main([Ljava/lang/String;)V: Graph of 26 nodes with 0 SCCs.

Infix2Postfix.buildExpression(I)LLinkedList;: Graph of 169 nodes with 2 SCCs.

Infix2Postfix.toPostfix(LLinkedList;)LLinkedList;: Graph of 439 nodes with 2 SCCs.

(3) FIGtoITRSProof (SOUND transformation)

Transformed FIGraph SCCs to IDPs. Logs:

Log for SCC 0:

Generated 31 rules for P and 3 rules for R.

Combined rules. Obtained 1 rules for P and 1 rules for R.

Filtered ground terms:

8520_0_toPostfix_NULL(x1, x2, x3, x4) → 8520_0_toPostfix_NULL(x2, x3, x4)
LinkedList(x1, x2, x3) → LinkedList(x2, x3)
8614_0_toPostfix_Return(x1, x2) → 8614_0_toPostfix_Return(x2)

Filtered duplicate args:

8520_0_toPostfix_NULL(x1, x2, x3) → 8520_0_toPostfix_NULL(x2, x3)

Filtered unneeded arguments:

8520_0_toPostfix_NULL(x1, x2) → 8520_0_toPostfix_NULL(x2)

Filtered all free variables:

8614_0_toPostfix_Return(x1) → 8614_0_toPostfix_Return

Finished conversion. Obtained 1 rules for P and 1 rules for R. System has no predefined symbols.

Log for SCC 1:

Generated 368 rules for P and 81 rules for R.

Combined rules. Obtained 28 rules for P and 3 rules for R.

Filtered ground terms:

8517_0_toPostfix_Store(x1, x2, x3, x4) → 8517_0_toPostfix_Store(x2, x3, x4)
LinkedList(x1, x2, x3) → LinkedList(x2, x3)
6432_0_toPostfix_NULL(x1, x2, x3, x4, x5) → 6432_0_toPostfix_NULL(x2, x3, x4, x5)
8514_0_toPostfix_Store(x1, x2, x3, x4) → 8514_0_toPostfix_Store(x2, x3, x4)
8511_0_toPostfix_Store(x1, x2, x3, x4) → 8511_0_toPostfix_Store(x2, x3, x4)
8508_0_toPostfix_Store(x1, x2, x3, x4) → 8508_0_toPostfix_Store(x2, x3, x4)
8934_0_toPostfix_Store(x1, x2, x3, x4) → 8934_0_toPostfix_Store(x2, x3, x4)
7120_0_toPostfix_Store(x1, x2, x3, x4) → 7120_0_toPostfix_Store(x2, x3, x4)
6725_0_toPostfix_New(x1, x2, x3, x4, x5) → 6725_0_toPostfix_New(x2, x3, x4)
6715_0_toPostfix_New(x1, x2, x3, x4, x5) → 6715_0_toPostfix_New(x2, x3, x4)
6653_0_toPostfix_New(x1, x2, x3, x4, x5) → 6653_0_toPostfix_New(x2, x3, x4, x5)
Cond_6432_0_toPostfix_NULL2(x1, x2, x3, x4, x5, x6) → Cond_6432_0_toPostfix_NULL2(x1, x3, x4, x5, x6)
Cond_6432_0_toPostfix_NULL1(x1, x2, x3, x4, x5, x6) → Cond_6432_0_toPostfix_NULL1(x1, x3, x4, x5, x6)
Cond_6432_0_toPostfix_NULL(x1, x2, x3, x4, x5, x6) → Cond_6432_0_toPostfix_NULL(x1, x3, x4, x5, x6)
8520_0_toPostfix_NULL(x1, x2, x3, x4) → 8520_0_toPostfix_NULL(x2, x3, x4)
8614_0_toPostfix_Return(x1, x2) → 8614_0_toPostfix_Return(x2)

Filtered duplicate args:

6432_0_toPostfix_NULL(x1, x2, x3, x4) → 6432_0_toPostfix_NULL(x2, x3, x4)
Cond_6432_0_toPostfix_NULL2(x1, x2, x3, x4, x5) → Cond_6432_0_toPostfix_NULL2(x1, x3, x4, x5)
Cond_6432_0_toPostfix_NULL1(x1, x2, x3, x4, x5) → Cond_6432_0_toPostfix_NULL1(x1, x3, x4, x5)
Cond_6432_0_toPostfix_NULL(x1, x2, x3, x4, x5) → Cond_6432_0_toPostfix_NULL(x1, x3, x4, x5)
8520_0_toPostfix_NULL(x1, x2, x3) → 8520_0_toPostfix_NULL(x2, x3)

Filtered unneeded arguments:

8520_0_toPostfix_NULL(x1, x2) → 8520_0_toPostfix_NULL(x2)

Filtered all free variables:

8614_0_toPostfix_Return(x1) → 8614_0_toPostfix_Return

Combined rules. Obtained 27 rules for P and 3 rules for R.

Finished conversion. Obtained 27 rules for P and 3 rules for R. System has predefined symbols.

Log for SCC 2:

Generated 22 rules for P and 3 rules for R.

Combined rules. Obtained 1 rules for P and 0 rules for R.

Filtered ground terms:

9722_0_buildExpression_Load(x1, x2, x3, x4) → 9722_0_buildExpression_Load(x2, x3, x4)
Cond_9722_0_buildExpression_Load(x1, x2, x3, x4, x5) → Cond_9722_0_buildExpression_Load(x1, x3, x4, x5)

Filtered duplicate args:

9722_0_buildExpression_Load(x1, x2, x3) → 9722_0_buildExpression_Load(x1, x3)
Cond_9722_0_buildExpression_Load(x1, x2, x3, x4) → Cond_9722_0_buildExpression_Load(x1, x2, x4)

Combined rules. Obtained 1 rules for P and 0 rules for R.

Finished conversion. Obtained 1 rules for P and 0 rules for R. System has predefined symbols.

Log for SCC 3:

Generated 132 rules for P and 32 rules for R.

Combined rules. Obtained 4 rules for P and 0 rules for R.

Filtered ground terms:

9911_0_buildExpression_GT(x1, x2, x3, x4, x5) → 9911_0_buildExpression_GT(x2, x3, x4, x5)
Cond_9262_0_buildExpression_Load1(x1, x2, x3, x4, x5) → Cond_9262_0_buildExpression_Load1(x1, x3, x4, x5)
9262_0_buildExpression_Load(x1, x2, x3, x4) → 9262_0_buildExpression_Load(x2, x3, x4)
Cond_9911_0_buildExpression_GT1(x1, x2, x3, x4, x5, x6) → Cond_9911_0_buildExpression_GT1(x1, x3, x4, x5, x6)
Cond_9911_0_buildExpression_GT(x1, x2, x3, x4, x5, x6) → Cond_9911_0_buildExpression_GT(x1, x3, x4, x5, x6)
Cond_9262_0_buildExpression_Load(x1, x2, x3, x4, x5) → Cond_9262_0_buildExpression_Load(x1, x3, x4, x5)

Filtered duplicate args:

9911_0_buildExpression_GT(x1, x2, x3, x4) → 9911_0_buildExpression_GT(x1, x3, x4)
Cond_9262_0_buildExpression_Load1(x1, x2, x3, x4) → Cond_9262_0_buildExpression_Load1(x1, x2, x4)
9262_0_buildExpression_Load(x1, x2, x3) → 9262_0_buildExpression_Load(x1, x3)
Cond_9911_0_buildExpression_GT1(x1, x2, x3, x4, x5) → Cond_9911_0_buildExpression_GT1(x1, x2, x4, x5)
Cond_9911_0_buildExpression_GT(x1, x2, x3, x4, x5) → Cond_9911_0_buildExpression_GT(x1, x2, x4, x5)
Cond_9262_0_buildExpression_Load(x1, x2, x3, x4) → Cond_9262_0_buildExpression_Load(x1, x2, x4)

Filtered unneeded arguments:

Cond_9911_0_buildExpression_GT(x1, x2, x3, x4) → Cond_9911_0_buildExpression_GT(x1, x2, x3)
Cond_9911_0_buildExpression_GT1(x1, x2, x3, x4) → Cond_9911_0_buildExpression_GT1(x1, x2, x3)

Combined rules. Obtained 4 rules for P and 0 rules for R.

Finished conversion. Obtained 4 rules for P and 0 rules for R. System has predefined symbols.

(4) Complex Obligation (AND)

(5) Obligation:

IDP problem:
The following function symbols are pre-defined:

!=	~	Neq: (Integer, Integer) -> Boolean
*	~	Mul: (Integer, Integer) -> Integer
>=	~	Ge: (Integer, Integer) -> Boolean
-1	~	UnaryMinus: (Integer) -> Integer
\|	~	Bwor: (Integer, Integer) -> Integer
/	~	Div: (Integer, Integer) -> Integer
=	~	Eq: (Integer, Integer) -> Boolean
	~	Bwxor: (Integer, Integer) -> Integer
\|\|	~	Lor: (Boolean, Boolean) -> Boolean
!	~	Lnot: (Boolean) -> Boolean
<	~	Lt: (Integer, Integer) -> Boolean
-	~	Sub: (Integer, Integer) -> Integer
<=	~	Le: (Integer, Integer) -> Boolean
>	~	Gt: (Integer, Integer) -> Boolean
~	~	Bwnot: (Integer) -> Integer
%	~	Mod: (Integer, Integer) -> Integer
&	~	Bwand: (Integer, Integer) -> Integer
+	~	Add: (Integer, Integer) -> Integer
&&	~	Land: (Boolean, Boolean) -> Boolean

The following domains are used:
none

The ITRS R consists of the following rules:
8520_0_toPostfix_NULL(NULL) → 8614_0_toPostfix_Return

The integer pair graph contains the following rules and edges:
(0): 8520_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x0[0], x1[0]))) → 8520_0_TOPOSTFIX_NULL(x1[0])

(0) -> (0), if ((x1[0] →^* java.lang.Object(LinkedList(x0[0]', x1[0]'))))

The set Q consists of the following terms:
8520_0_toPostfix_NULL(NULL)

(6) IDPtoQDPProof (SOUND transformation)

Represented integers and predefined function symbols by Terms

(7) Obligation:

Q DP problem:
The TRS P consists of the following rules:

8520_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x0[0], x1[0]))) → 8520_0_TOPOSTFIX_NULL(x1[0])

The TRS R consists of the following rules:

8520_0_toPostfix_NULL(NULL) → 8614_0_toPostfix_Return

The set Q consists of the following terms:

8520_0_toPostfix_NULL(NULL)

We have to consider all minimal (P,Q,R)-chains.

(8) UsableRulesProof (EQUIVALENT transformation)

As all Q-normal forms are R-normal forms we are in the innermost case. Hence, by the usable rules processor [LPAR04] we can delete all non-usable rules [FROCOS05] from R.

(9) Obligation:

Q DP problem:
The TRS P consists of the following rules:

8520_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x0[0], x1[0]))) → 8520_0_TOPOSTFIX_NULL(x1[0])

R is empty.
The set Q consists of the following terms:

8520_0_toPostfix_NULL(NULL)

We have to consider all minimal (P,Q,R)-chains.

(10) QReductionProof (EQUIVALENT transformation)

We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.[THIEMANN].

8520_0_toPostfix_NULL(NULL)

(11) Obligation:

Q DP problem:
The TRS P consists of the following rules:

8520_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x0[0], x1[0]))) → 8520_0_TOPOSTFIX_NULL(x1[0])

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(12) QDPSizeChangeProof (EQUIVALENT transformation)

By using the subterm criterion [SUBTERM_CRITERION] together with the size-change analysis [AAECC05] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:

8520_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x0[0], x1[0]))) → 8520_0_TOPOSTFIX_NULL(x1[0])
The graph contains the following edges 1 > 1

(13) YES

(14) Obligation:

IDP problem:
The following function symbols are pre-defined:

!=	~	Neq: (Integer, Integer) -> Boolean
*	~	Mul: (Integer, Integer) -> Integer
>=	~	Ge: (Integer, Integer) -> Boolean
-1	~	UnaryMinus: (Integer) -> Integer
\|	~	Bwor: (Integer, Integer) -> Integer
/	~	Div: (Integer, Integer) -> Integer
=	~	Eq: (Integer, Integer) -> Boolean
	~	Bwxor: (Integer, Integer) -> Integer
\|\|	~	Lor: (Boolean, Boolean) -> Boolean
!	~	Lnot: (Boolean) -> Boolean
<	~	Lt: (Integer, Integer) -> Boolean
-	~	Sub: (Integer, Integer) -> Integer
<=	~	Le: (Integer, Integer) -> Boolean
>	~	Gt: (Integer, Integer) -> Boolean
~	~	Bwnot: (Integer) -> Integer
%	~	Mod: (Integer, Integer) -> Integer
&	~	Bwand: (Integer, Integer) -> Integer
+	~	Add: (Integer, Integer) -> Integer
&&	~	Land: (Boolean, Boolean) -> Boolean

The following domains are used:

Integer

The ITRS R consists of the following rules:
6432_0_toPostfix_NULL(x0, x1, NULL) → 8520_0_toPostfix_NULL(x1)
8520_0_toPostfix_NULL(NULL) → 8614_0_toPostfix_Return
8520_0_toPostfix_NULL(java.lang.Object(LinkedList(x0, x1))) → 8520_0_toPostfix_NULL(x1)

The integer pair graph contains the following rules and edges:
(0): 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0]) → 6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])
(1): 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]) → 6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])
(2): 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])
(3): 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])
(4): 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])
(5): 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])
(6): 6432_0_TOPOSTFIX_NULL(x2[6], x3[6], java.lang.Object(LinkedList(x0[6], x1[6]))) → COND_6432_0_TOPOSTFIX_NULL(x0[6] < 40, x2[6], x3[6], java.lang.Object(LinkedList(x0[6], x1[6])))
(7): COND_6432_0_TOPOSTFIX_NULL(TRUE, x2[7], x3[7], java.lang.Object(LinkedList(x0[7], x1[7]))) → 6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), x1[7])
(8): 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8]))) → 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])
(9): 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9]))) → 6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])
(10): 6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])
(11): 6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])
(12): 6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12]))) → 6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])
(13): 6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])
(14): 6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14]))) → 6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])
(15): 6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])
(16): 6432_0_TOPOSTFIX_NULL(x2[16], x3[16], java.lang.Object(LinkedList(x0[16], x1[16]))) → COND_6432_0_TOPOSTFIX_NULL(x0[16] > 47, x2[16], x3[16], java.lang.Object(LinkedList(x0[16], x1[16])))
(17): 6715_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(44, x1[17])), x2[17], x3[17]) → 6432_0_TOPOSTFIX_NULL(x2[17], java.lang.Object(LinkedList(44, x3[17])), x1[17])
(18): 6725_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(46, x1[18])), x2[18], x3[18]) → 6432_0_TOPOSTFIX_NULL(x2[18], java.lang.Object(LinkedList(46, x3[18])), x1[18])
(19): 6432_0_TOPOSTFIX_NULL(x2[19], x3[19], java.lang.Object(LinkedList(44, x1[19]))) → 6715_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(44, x1[19])), x2[19], x3[19])
(20): 6432_0_TOPOSTFIX_NULL(x2[20], x3[20], java.lang.Object(LinkedList(46, x1[20]))) → 6725_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(46, x1[20])), x2[20], x3[20])
(21): 6432_0_TOPOSTFIX_NULL(x2[21], x3[21], java.lang.Object(LinkedList(40, x1[21]))) → 7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])
(22): 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x4[22], java.lang.Object(LinkedList(41, x1[22]))) → 8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])
(23): 6432_0_TOPOSTFIX_NULL(x2[23], x3[23], java.lang.Object(LinkedList(42, x1[23]))) → 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])
(24): 6432_0_TOPOSTFIX_NULL(x2[24], x3[24], java.lang.Object(LinkedList(43, x1[24]))) → 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])
(25): 6432_0_TOPOSTFIX_NULL(x2[25], x3[25], java.lang.Object(LinkedList(45, x1[25]))) → 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])
(26): 6432_0_TOPOSTFIX_NULL(x2[26], x3[26], java.lang.Object(LinkedList(47, x1[26]))) → 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])

(0) -> (6), if ((x0[0] →^* x2[6])∧(x1[0] →^* x3[6])∧(x2[0] →^* java.lang.Object(LinkedList(x0[6], x1[6]))))

(0) -> (8), if ((x0[0] →^* x2[8])∧(x1[0] →^* x3[8])∧(x2[0] →^* java.lang.Object(LinkedList(40, x1[8]))))

(0) -> (9), if ((x0[0] →^* java.lang.Object(LinkedList(x2[9], x3[9])))∧(x1[0] →^* x4[9])∧(x2[0] →^* java.lang.Object(LinkedList(41, x1[9]))))

(0) -> (10), if ((x0[0] →^* x2[10])∧(x1[0] →^* x3[10])∧(x2[0] →^* java.lang.Object(LinkedList(42, x1[10]))))

(0) -> (11), if ((x0[0] →^* x2[11])∧(x1[0] →^* x3[11])∧(x2[0] →^* java.lang.Object(LinkedList(43, x1[11]))))

(0) -> (12), if ((x0[0] →^* x2[12])∧(x1[0] →^* x3[12])∧(x2[0] →^* java.lang.Object(LinkedList(44, x1[12]))))

(0) -> (13), if ((x0[0] →^* x2[13])∧(x1[0] →^* x3[13])∧(x2[0] →^* java.lang.Object(LinkedList(45, x1[13]))))

(0) -> (14), if ((x0[0] →^* x2[14])∧(x1[0] →^* x3[14])∧(x2[0] →^* java.lang.Object(LinkedList(46, x1[14]))))

(0) -> (15), if ((x0[0] →^* x2[15])∧(x1[0] →^* x3[15])∧(x2[0] →^* java.lang.Object(LinkedList(47, x1[15]))))

(0) -> (16), if ((x0[0] →^* x2[16])∧(x1[0] →^* x3[16])∧(x2[0] →^* java.lang.Object(LinkedList(x0[16], x1[16]))))

(0) -> (19), if ((x0[0] →^* x2[19])∧(x1[0] →^* x3[19])∧(x2[0] →^* java.lang.Object(LinkedList(44, x1[19]))))

(0) -> (20), if ((x0[0] →^* x2[20])∧(x1[0] →^* x3[20])∧(x2[0] →^* java.lang.Object(LinkedList(46, x1[20]))))

(0) -> (21), if ((x0[0] →^* x2[21])∧(x1[0] →^* x3[21])∧(x2[0] →^* java.lang.Object(LinkedList(40, x1[21]))))

(0) -> (22), if ((x0[0] →^* java.lang.Object(LinkedList(x2[22], x3[22])))∧(x1[0] →^* x4[22])∧(x2[0] →^* java.lang.Object(LinkedList(41, x1[22]))))

(0) -> (23), if ((x0[0] →^* x2[23])∧(x1[0] →^* x3[23])∧(x2[0] →^* java.lang.Object(LinkedList(42, x1[23]))))

(0) -> (24), if ((x0[0] →^* x2[24])∧(x1[0] →^* x3[24])∧(x2[0] →^* java.lang.Object(LinkedList(43, x1[24]))))

(0) -> (25), if ((x0[0] →^* x2[25])∧(x1[0] →^* x3[25])∧(x2[0] →^* java.lang.Object(LinkedList(45, x1[25]))))

(0) -> (26), if ((x0[0] →^* x2[26])∧(x1[0] →^* x3[26])∧(x2[0] →^* java.lang.Object(LinkedList(47, x1[26]))))

(1) -> (6), if ((x0[1] →^* x2[6])∧(java.lang.Object(LinkedList(x1[1], x2[1])) →^* x3[6])∧(x3[1] →^* java.lang.Object(LinkedList(x0[6], x1[6]))))

(1) -> (8), if ((x0[1] →^* x2[8])∧(java.lang.Object(LinkedList(x1[1], x2[1])) →^* x3[8])∧(x3[1] →^* java.lang.Object(LinkedList(40, x1[8]))))

(1) -> (9), if ((x0[1] →^* java.lang.Object(LinkedList(x2[9], x3[9])))∧(java.lang.Object(LinkedList(x1[1], x2[1])) →^* x4[9])∧(x3[1] →^* java.lang.Object(LinkedList(41, x1[9]))))

(1) -> (10), if ((x0[1] →^* x2[10])∧(java.lang.Object(LinkedList(x1[1], x2[1])) →^* x3[10])∧(x3[1] →^* java.lang.Object(LinkedList(42, x1[10]))))

(1) -> (11), if ((x0[1] →^* x2[11])∧(java.lang.Object(LinkedList(x1[1], x2[1])) →^* x3[11])∧(x3[1] →^* java.lang.Object(LinkedList(43, x1[11]))))

(1) -> (12), if ((x0[1] →^* x2[12])∧(java.lang.Object(LinkedList(x1[1], x2[1])) →^* x3[12])∧(x3[1] →^* java.lang.Object(LinkedList(44, x1[12]))))

(1) -> (13), if ((x0[1] →^* x2[13])∧(java.lang.Object(LinkedList(x1[1], x2[1])) →^* x3[13])∧(x3[1] →^* java.lang.Object(LinkedList(45, x1[13]))))

(1) -> (14), if ((x0[1] →^* x2[14])∧(java.lang.Object(LinkedList(x1[1], x2[1])) →^* x3[14])∧(x3[1] →^* java.lang.Object(LinkedList(46, x1[14]))))

(1) -> (15), if ((x0[1] →^* x2[15])∧(java.lang.Object(LinkedList(x1[1], x2[1])) →^* x3[15])∧(x3[1] →^* java.lang.Object(LinkedList(47, x1[15]))))

(1) -> (16), if ((x0[1] →^* x2[16])∧(java.lang.Object(LinkedList(x1[1], x2[1])) →^* x3[16])∧(x3[1] →^* java.lang.Object(LinkedList(x0[16], x1[16]))))

(1) -> (19), if ((x0[1] →^* x2[19])∧(java.lang.Object(LinkedList(x1[1], x2[1])) →^* x3[19])∧(x3[1] →^* java.lang.Object(LinkedList(44, x1[19]))))

(1) -> (20), if ((x0[1] →^* x2[20])∧(java.lang.Object(LinkedList(x1[1], x2[1])) →^* x3[20])∧(x3[1] →^* java.lang.Object(LinkedList(46, x1[20]))))

(1) -> (21), if ((x0[1] →^* x2[21])∧(java.lang.Object(LinkedList(x1[1], x2[1])) →^* x3[21])∧(x3[1] →^* java.lang.Object(LinkedList(40, x1[21]))))

(1) -> (22), if ((x0[1] →^* java.lang.Object(LinkedList(x2[22], x3[22])))∧(java.lang.Object(LinkedList(x1[1], x2[1])) →^* x4[22])∧(x3[1] →^* java.lang.Object(LinkedList(41, x1[22]))))

(1) -> (23), if ((x0[1] →^* x2[23])∧(java.lang.Object(LinkedList(x1[1], x2[1])) →^* x3[23])∧(x3[1] →^* java.lang.Object(LinkedList(42, x1[23]))))

(1) -> (24), if ((x0[1] →^* x2[24])∧(java.lang.Object(LinkedList(x1[1], x2[1])) →^* x3[24])∧(x3[1] →^* java.lang.Object(LinkedList(43, x1[24]))))

(1) -> (25), if ((x0[1] →^* x2[25])∧(java.lang.Object(LinkedList(x1[1], x2[1])) →^* x3[25])∧(x3[1] →^* java.lang.Object(LinkedList(45, x1[25]))))

(1) -> (26), if ((x0[1] →^* x2[26])∧(java.lang.Object(LinkedList(x1[1], x2[1])) →^* x3[26])∧(x3[1] →^* java.lang.Object(LinkedList(47, x1[26]))))

(2) -> (6), if ((java.lang.Object(LinkedList(42, x1[2])) →^* x2[6])∧(x2[2] →^* x3[6])∧(x3[2] →^* java.lang.Object(LinkedList(x0[6], x1[6]))))

(2) -> (8), if ((java.lang.Object(LinkedList(42, x1[2])) →^* x2[8])∧(x2[2] →^* x3[8])∧(x3[2] →^* java.lang.Object(LinkedList(40, x1[8]))))

(2) -> (9), if ((java.lang.Object(LinkedList(42, x1[2])) →^* java.lang.Object(LinkedList(x2[9], x3[9])))∧(x2[2] →^* x4[9])∧(x3[2] →^* java.lang.Object(LinkedList(41, x1[9]))))

(2) -> (10), if ((java.lang.Object(LinkedList(42, x1[2])) →^* x2[10])∧(x2[2] →^* x3[10])∧(x3[2] →^* java.lang.Object(LinkedList(42, x1[10]))))

(2) -> (11), if ((java.lang.Object(LinkedList(42, x1[2])) →^* x2[11])∧(x2[2] →^* x3[11])∧(x3[2] →^* java.lang.Object(LinkedList(43, x1[11]))))

(2) -> (12), if ((java.lang.Object(LinkedList(42, x1[2])) →^* x2[12])∧(x2[2] →^* x3[12])∧(x3[2] →^* java.lang.Object(LinkedList(44, x1[12]))))

(2) -> (13), if ((java.lang.Object(LinkedList(42, x1[2])) →^* x2[13])∧(x2[2] →^* x3[13])∧(x3[2] →^* java.lang.Object(LinkedList(45, x1[13]))))

(2) -> (14), if ((java.lang.Object(LinkedList(42, x1[2])) →^* x2[14])∧(x2[2] →^* x3[14])∧(x3[2] →^* java.lang.Object(LinkedList(46, x1[14]))))

(2) -> (15), if ((java.lang.Object(LinkedList(42, x1[2])) →^* x2[15])∧(x2[2] →^* x3[15])∧(x3[2] →^* java.lang.Object(LinkedList(47, x1[15]))))

(2) -> (16), if ((java.lang.Object(LinkedList(42, x1[2])) →^* x2[16])∧(x2[2] →^* x3[16])∧(x3[2] →^* java.lang.Object(LinkedList(x0[16], x1[16]))))

(2) -> (19), if ((java.lang.Object(LinkedList(42, x1[2])) →^* x2[19])∧(x2[2] →^* x3[19])∧(x3[2] →^* java.lang.Object(LinkedList(44, x1[19]))))

(2) -> (20), if ((java.lang.Object(LinkedList(42, x1[2])) →^* x2[20])∧(x2[2] →^* x3[20])∧(x3[2] →^* java.lang.Object(LinkedList(46, x1[20]))))

(2) -> (21), if ((java.lang.Object(LinkedList(42, x1[2])) →^* x2[21])∧(x2[2] →^* x3[21])∧(x3[2] →^* java.lang.Object(LinkedList(40, x1[21]))))

(2) -> (22), if ((java.lang.Object(LinkedList(42, x1[2])) →^* java.lang.Object(LinkedList(x2[22], x3[22])))∧(x2[2] →^* x4[22])∧(x3[2] →^* java.lang.Object(LinkedList(41, x1[22]))))

(2) -> (23), if ((java.lang.Object(LinkedList(42, x1[2])) →^* x2[23])∧(x2[2] →^* x3[23])∧(x3[2] →^* java.lang.Object(LinkedList(42, x1[23]))))

(2) -> (24), if ((java.lang.Object(LinkedList(42, x1[2])) →^* x2[24])∧(x2[2] →^* x3[24])∧(x3[2] →^* java.lang.Object(LinkedList(43, x1[24]))))

(2) -> (25), if ((java.lang.Object(LinkedList(42, x1[2])) →^* x2[25])∧(x2[2] →^* x3[25])∧(x3[2] →^* java.lang.Object(LinkedList(45, x1[25]))))

(2) -> (26), if ((java.lang.Object(LinkedList(42, x1[2])) →^* x2[26])∧(x2[2] →^* x3[26])∧(x3[2] →^* java.lang.Object(LinkedList(47, x1[26]))))

(3) -> (6), if ((java.lang.Object(LinkedList(43, x1[3])) →^* x2[6])∧(x2[3] →^* x3[6])∧(x3[3] →^* java.lang.Object(LinkedList(x0[6], x1[6]))))

(3) -> (8), if ((java.lang.Object(LinkedList(43, x1[3])) →^* x2[8])∧(x2[3] →^* x3[8])∧(x3[3] →^* java.lang.Object(LinkedList(40, x1[8]))))

(3) -> (9), if ((java.lang.Object(LinkedList(43, x1[3])) →^* java.lang.Object(LinkedList(x2[9], x3[9])))∧(x2[3] →^* x4[9])∧(x3[3] →^* java.lang.Object(LinkedList(41, x1[9]))))

(3) -> (10), if ((java.lang.Object(LinkedList(43, x1[3])) →^* x2[10])∧(x2[3] →^* x3[10])∧(x3[3] →^* java.lang.Object(LinkedList(42, x1[10]))))

(3) -> (11), if ((java.lang.Object(LinkedList(43, x1[3])) →^* x2[11])∧(x2[3] →^* x3[11])∧(x3[3] →^* java.lang.Object(LinkedList(43, x1[11]))))

(3) -> (12), if ((java.lang.Object(LinkedList(43, x1[3])) →^* x2[12])∧(x2[3] →^* x3[12])∧(x3[3] →^* java.lang.Object(LinkedList(44, x1[12]))))

(3) -> (13), if ((java.lang.Object(LinkedList(43, x1[3])) →^* x2[13])∧(x2[3] →^* x3[13])∧(x3[3] →^* java.lang.Object(LinkedList(45, x1[13]))))

(3) -> (14), if ((java.lang.Object(LinkedList(43, x1[3])) →^* x2[14])∧(x2[3] →^* x3[14])∧(x3[3] →^* java.lang.Object(LinkedList(46, x1[14]))))

(3) -> (15), if ((java.lang.Object(LinkedList(43, x1[3])) →^* x2[15])∧(x2[3] →^* x3[15])∧(x3[3] →^* java.lang.Object(LinkedList(47, x1[15]))))

(3) -> (16), if ((java.lang.Object(LinkedList(43, x1[3])) →^* x2[16])∧(x2[3] →^* x3[16])∧(x3[3] →^* java.lang.Object(LinkedList(x0[16], x1[16]))))

(3) -> (19), if ((java.lang.Object(LinkedList(43, x1[3])) →^* x2[19])∧(x2[3] →^* x3[19])∧(x3[3] →^* java.lang.Object(LinkedList(44, x1[19]))))

(3) -> (20), if ((java.lang.Object(LinkedList(43, x1[3])) →^* x2[20])∧(x2[3] →^* x3[20])∧(x3[3] →^* java.lang.Object(LinkedList(46, x1[20]))))

(3) -> (21), if ((java.lang.Object(LinkedList(43, x1[3])) →^* x2[21])∧(x2[3] →^* x3[21])∧(x3[3] →^* java.lang.Object(LinkedList(40, x1[21]))))

(3) -> (22), if ((java.lang.Object(LinkedList(43, x1[3])) →^* java.lang.Object(LinkedList(x2[22], x3[22])))∧(x2[3] →^* x4[22])∧(x3[3] →^* java.lang.Object(LinkedList(41, x1[22]))))

(3) -> (23), if ((java.lang.Object(LinkedList(43, x1[3])) →^* x2[23])∧(x2[3] →^* x3[23])∧(x3[3] →^* java.lang.Object(LinkedList(42, x1[23]))))

(3) -> (24), if ((java.lang.Object(LinkedList(43, x1[3])) →^* x2[24])∧(x2[3] →^* x3[24])∧(x3[3] →^* java.lang.Object(LinkedList(43, x1[24]))))

(3) -> (25), if ((java.lang.Object(LinkedList(43, x1[3])) →^* x2[25])∧(x2[3] →^* x3[25])∧(x3[3] →^* java.lang.Object(LinkedList(45, x1[25]))))

(3) -> (26), if ((java.lang.Object(LinkedList(43, x1[3])) →^* x2[26])∧(x2[3] →^* x3[26])∧(x3[3] →^* java.lang.Object(LinkedList(47, x1[26]))))

(4) -> (6), if ((java.lang.Object(LinkedList(45, x1[4])) →^* x2[6])∧(x2[4] →^* x3[6])∧(x3[4] →^* java.lang.Object(LinkedList(x0[6], x1[6]))))

(4) -> (8), if ((java.lang.Object(LinkedList(45, x1[4])) →^* x2[8])∧(x2[4] →^* x3[8])∧(x3[4] →^* java.lang.Object(LinkedList(40, x1[8]))))

(4) -> (9), if ((java.lang.Object(LinkedList(45, x1[4])) →^* java.lang.Object(LinkedList(x2[9], x3[9])))∧(x2[4] →^* x4[9])∧(x3[4] →^* java.lang.Object(LinkedList(41, x1[9]))))

(4) -> (10), if ((java.lang.Object(LinkedList(45, x1[4])) →^* x2[10])∧(x2[4] →^* x3[10])∧(x3[4] →^* java.lang.Object(LinkedList(42, x1[10]))))

(4) -> (11), if ((java.lang.Object(LinkedList(45, x1[4])) →^* x2[11])∧(x2[4] →^* x3[11])∧(x3[4] →^* java.lang.Object(LinkedList(43, x1[11]))))

(4) -> (12), if ((java.lang.Object(LinkedList(45, x1[4])) →^* x2[12])∧(x2[4] →^* x3[12])∧(x3[4] →^* java.lang.Object(LinkedList(44, x1[12]))))

(4) -> (13), if ((java.lang.Object(LinkedList(45, x1[4])) →^* x2[13])∧(x2[4] →^* x3[13])∧(x3[4] →^* java.lang.Object(LinkedList(45, x1[13]))))

(4) -> (14), if ((java.lang.Object(LinkedList(45, x1[4])) →^* x2[14])∧(x2[4] →^* x3[14])∧(x3[4] →^* java.lang.Object(LinkedList(46, x1[14]))))

(4) -> (15), if ((java.lang.Object(LinkedList(45, x1[4])) →^* x2[15])∧(x2[4] →^* x3[15])∧(x3[4] →^* java.lang.Object(LinkedList(47, x1[15]))))

(4) -> (16), if ((java.lang.Object(LinkedList(45, x1[4])) →^* x2[16])∧(x2[4] →^* x3[16])∧(x3[4] →^* java.lang.Object(LinkedList(x0[16], x1[16]))))

(4) -> (19), if ((java.lang.Object(LinkedList(45, x1[4])) →^* x2[19])∧(x2[4] →^* x3[19])∧(x3[4] →^* java.lang.Object(LinkedList(44, x1[19]))))

(4) -> (20), if ((java.lang.Object(LinkedList(45, x1[4])) →^* x2[20])∧(x2[4] →^* x3[20])∧(x3[4] →^* java.lang.Object(LinkedList(46, x1[20]))))

(4) -> (21), if ((java.lang.Object(LinkedList(45, x1[4])) →^* x2[21])∧(x2[4] →^* x3[21])∧(x3[4] →^* java.lang.Object(LinkedList(40, x1[21]))))

(4) -> (22), if ((java.lang.Object(LinkedList(45, x1[4])) →^* java.lang.Object(LinkedList(x2[22], x3[22])))∧(x2[4] →^* x4[22])∧(x3[4] →^* java.lang.Object(LinkedList(41, x1[22]))))

(4) -> (23), if ((java.lang.Object(LinkedList(45, x1[4])) →^* x2[23])∧(x2[4] →^* x3[23])∧(x3[4] →^* java.lang.Object(LinkedList(42, x1[23]))))

(4) -> (24), if ((java.lang.Object(LinkedList(45, x1[4])) →^* x2[24])∧(x2[4] →^* x3[24])∧(x3[4] →^* java.lang.Object(LinkedList(43, x1[24]))))

(4) -> (25), if ((java.lang.Object(LinkedList(45, x1[4])) →^* x2[25])∧(x2[4] →^* x3[25])∧(x3[4] →^* java.lang.Object(LinkedList(45, x1[25]))))

(4) -> (26), if ((java.lang.Object(LinkedList(45, x1[4])) →^* x2[26])∧(x2[4] →^* x3[26])∧(x3[4] →^* java.lang.Object(LinkedList(47, x1[26]))))

(5) -> (6), if ((java.lang.Object(LinkedList(47, x1[5])) →^* x2[6])∧(x2[5] →^* x3[6])∧(x3[5] →^* java.lang.Object(LinkedList(x0[6], x1[6]))))

(5) -> (8), if ((java.lang.Object(LinkedList(47, x1[5])) →^* x2[8])∧(x2[5] →^* x3[8])∧(x3[5] →^* java.lang.Object(LinkedList(40, x1[8]))))

(5) -> (9), if ((java.lang.Object(LinkedList(47, x1[5])) →^* java.lang.Object(LinkedList(x2[9], x3[9])))∧(x2[5] →^* x4[9])∧(x3[5] →^* java.lang.Object(LinkedList(41, x1[9]))))

(5) -> (10), if ((java.lang.Object(LinkedList(47, x1[5])) →^* x2[10])∧(x2[5] →^* x3[10])∧(x3[5] →^* java.lang.Object(LinkedList(42, x1[10]))))

(5) -> (11), if ((java.lang.Object(LinkedList(47, x1[5])) →^* x2[11])∧(x2[5] →^* x3[11])∧(x3[5] →^* java.lang.Object(LinkedList(43, x1[11]))))

(5) -> (12), if ((java.lang.Object(LinkedList(47, x1[5])) →^* x2[12])∧(x2[5] →^* x3[12])∧(x3[5] →^* java.lang.Object(LinkedList(44, x1[12]))))

(5) -> (13), if ((java.lang.Object(LinkedList(47, x1[5])) →^* x2[13])∧(x2[5] →^* x3[13])∧(x3[5] →^* java.lang.Object(LinkedList(45, x1[13]))))

(5) -> (14), if ((java.lang.Object(LinkedList(47, x1[5])) →^* x2[14])∧(x2[5] →^* x3[14])∧(x3[5] →^* java.lang.Object(LinkedList(46, x1[14]))))

(5) -> (15), if ((java.lang.Object(LinkedList(47, x1[5])) →^* x2[15])∧(x2[5] →^* x3[15])∧(x3[5] →^* java.lang.Object(LinkedList(47, x1[15]))))

(5) -> (16), if ((java.lang.Object(LinkedList(47, x1[5])) →^* x2[16])∧(x2[5] →^* x3[16])∧(x3[5] →^* java.lang.Object(LinkedList(x0[16], x1[16]))))

(5) -> (19), if ((java.lang.Object(LinkedList(47, x1[5])) →^* x2[19])∧(x2[5] →^* x3[19])∧(x3[5] →^* java.lang.Object(LinkedList(44, x1[19]))))

(5) -> (20), if ((java.lang.Object(LinkedList(47, x1[5])) →^* x2[20])∧(x2[5] →^* x3[20])∧(x3[5] →^* java.lang.Object(LinkedList(46, x1[20]))))

(5) -> (21), if ((java.lang.Object(LinkedList(47, x1[5])) →^* x2[21])∧(x2[5] →^* x3[21])∧(x3[5] →^* java.lang.Object(LinkedList(40, x1[21]))))

(5) -> (22), if ((java.lang.Object(LinkedList(47, x1[5])) →^* java.lang.Object(LinkedList(x2[22], x3[22])))∧(x2[5] →^* x4[22])∧(x3[5] →^* java.lang.Object(LinkedList(41, x1[22]))))

(5) -> (23), if ((java.lang.Object(LinkedList(47, x1[5])) →^* x2[23])∧(x2[5] →^* x3[23])∧(x3[5] →^* java.lang.Object(LinkedList(42, x1[23]))))

(5) -> (24), if ((java.lang.Object(LinkedList(47, x1[5])) →^* x2[24])∧(x2[5] →^* x3[24])∧(x3[5] →^* java.lang.Object(LinkedList(43, x1[24]))))

(5) -> (25), if ((java.lang.Object(LinkedList(47, x1[5])) →^* x2[25])∧(x2[5] →^* x3[25])∧(x3[5] →^* java.lang.Object(LinkedList(45, x1[25]))))

(5) -> (26), if ((java.lang.Object(LinkedList(47, x1[5])) →^* x2[26])∧(x2[5] →^* x3[26])∧(x3[5] →^* java.lang.Object(LinkedList(47, x1[26]))))

(6) -> (7), if ((x0[6] < 40 →^* TRUE)∧(x2[6] →^* x2[7])∧(x3[6] →^* x3[7])∧(java.lang.Object(LinkedList(x0[6], x1[6])) →^* java.lang.Object(LinkedList(x0[7], x1[7]))))

(7) -> (6), if ((x2[7] →^* x2[6])∧(java.lang.Object(LinkedList(x0[7], x3[7])) →^* x3[6])∧(x1[7] →^* java.lang.Object(LinkedList(x0[6], x1[6]))))

(7) -> (8), if ((x2[7] →^* x2[8])∧(java.lang.Object(LinkedList(x0[7], x3[7])) →^* x3[8])∧(x1[7] →^* java.lang.Object(LinkedList(40, x1[8]))))

(7) -> (9), if ((x2[7] →^* java.lang.Object(LinkedList(x2[9], x3[9])))∧(java.lang.Object(LinkedList(x0[7], x3[7])) →^* x4[9])∧(x1[7] →^* java.lang.Object(LinkedList(41, x1[9]))))

(7) -> (10), if ((x2[7] →^* x2[10])∧(java.lang.Object(LinkedList(x0[7], x3[7])) →^* x3[10])∧(x1[7] →^* java.lang.Object(LinkedList(42, x1[10]))))

(7) -> (11), if ((x2[7] →^* x2[11])∧(java.lang.Object(LinkedList(x0[7], x3[7])) →^* x3[11])∧(x1[7] →^* java.lang.Object(LinkedList(43, x1[11]))))

(7) -> (12), if ((x2[7] →^* x2[12])∧(java.lang.Object(LinkedList(x0[7], x3[7])) →^* x3[12])∧(x1[7] →^* java.lang.Object(LinkedList(44, x1[12]))))

(7) -> (13), if ((x2[7] →^* x2[13])∧(java.lang.Object(LinkedList(x0[7], x3[7])) →^* x3[13])∧(x1[7] →^* java.lang.Object(LinkedList(45, x1[13]))))

(7) -> (14), if ((x2[7] →^* x2[14])∧(java.lang.Object(LinkedList(x0[7], x3[7])) →^* x3[14])∧(x1[7] →^* java.lang.Object(LinkedList(46, x1[14]))))

(7) -> (15), if ((x2[7] →^* x2[15])∧(java.lang.Object(LinkedList(x0[7], x3[7])) →^* x3[15])∧(x1[7] →^* java.lang.Object(LinkedList(47, x1[15]))))

(7) -> (16), if ((x2[7] →^* x2[16])∧(java.lang.Object(LinkedList(x0[7], x3[7])) →^* x3[16])∧(x1[7] →^* java.lang.Object(LinkedList(x0[16], x1[16]))))

(7) -> (19), if ((x2[7] →^* x2[19])∧(java.lang.Object(LinkedList(x0[7], x3[7])) →^* x3[19])∧(x1[7] →^* java.lang.Object(LinkedList(44, x1[19]))))

(7) -> (20), if ((x2[7] →^* x2[20])∧(java.lang.Object(LinkedList(x0[7], x3[7])) →^* x3[20])∧(x1[7] →^* java.lang.Object(LinkedList(46, x1[20]))))

(7) -> (21), if ((x2[7] →^* x2[21])∧(java.lang.Object(LinkedList(x0[7], x3[7])) →^* x3[21])∧(x1[7] →^* java.lang.Object(LinkedList(40, x1[21]))))

(7) -> (22), if ((x2[7] →^* java.lang.Object(LinkedList(x2[22], x3[22])))∧(java.lang.Object(LinkedList(x0[7], x3[7])) →^* x4[22])∧(x1[7] →^* java.lang.Object(LinkedList(41, x1[22]))))

(7) -> (23), if ((x2[7] →^* x2[23])∧(java.lang.Object(LinkedList(x0[7], x3[7])) →^* x3[23])∧(x1[7] →^* java.lang.Object(LinkedList(42, x1[23]))))

(7) -> (24), if ((x2[7] →^* x2[24])∧(java.lang.Object(LinkedList(x0[7], x3[7])) →^* x3[24])∧(x1[7] →^* java.lang.Object(LinkedList(43, x1[24]))))

(7) -> (25), if ((x2[7] →^* x2[25])∧(java.lang.Object(LinkedList(x0[7], x3[7])) →^* x3[25])∧(x1[7] →^* java.lang.Object(LinkedList(45, x1[25]))))

(7) -> (26), if ((x2[7] →^* x2[26])∧(java.lang.Object(LinkedList(x0[7], x3[7])) →^* x3[26])∧(x1[7] →^* java.lang.Object(LinkedList(47, x1[26]))))

(8) -> (6), if ((x2[8] →^* x2[6])∧(x3[8] →^* x3[6])∧(x1[8] →^* java.lang.Object(LinkedList(x0[6], x1[6]))))

(8) -> (8), if ((x2[8] →^* x2[8]')∧(x3[8] →^* x3[8]')∧(x1[8] →^* java.lang.Object(LinkedList(40, x1[8]'))))

(8) -> (9), if ((x2[8] →^* java.lang.Object(LinkedList(x2[9], x3[9])))∧(x3[8] →^* x4[9])∧(x1[8] →^* java.lang.Object(LinkedList(41, x1[9]))))

(8) -> (10), if ((x2[8] →^* x2[10])∧(x3[8] →^* x3[10])∧(x1[8] →^* java.lang.Object(LinkedList(42, x1[10]))))

(8) -> (11), if ((x2[8] →^* x2[11])∧(x3[8] →^* x3[11])∧(x1[8] →^* java.lang.Object(LinkedList(43, x1[11]))))

(8) -> (12), if ((x2[8] →^* x2[12])∧(x3[8] →^* x3[12])∧(x1[8] →^* java.lang.Object(LinkedList(44, x1[12]))))

(8) -> (13), if ((x2[8] →^* x2[13])∧(x3[8] →^* x3[13])∧(x1[8] →^* java.lang.Object(LinkedList(45, x1[13]))))

(8) -> (14), if ((x2[8] →^* x2[14])∧(x3[8] →^* x3[14])∧(x1[8] →^* java.lang.Object(LinkedList(46, x1[14]))))

(8) -> (15), if ((x2[8] →^* x2[15])∧(x3[8] →^* x3[15])∧(x1[8] →^* java.lang.Object(LinkedList(47, x1[15]))))

(8) -> (16), if ((x2[8] →^* x2[16])∧(x3[8] →^* x3[16])∧(x1[8] →^* java.lang.Object(LinkedList(x0[16], x1[16]))))

(8) -> (19), if ((x2[8] →^* x2[19])∧(x3[8] →^* x3[19])∧(x1[8] →^* java.lang.Object(LinkedList(44, x1[19]))))

(8) -> (20), if ((x2[8] →^* x2[20])∧(x3[8] →^* x3[20])∧(x1[8] →^* java.lang.Object(LinkedList(46, x1[20]))))

(8) -> (21), if ((x2[8] →^* x2[21])∧(x3[8] →^* x3[21])∧(x1[8] →^* java.lang.Object(LinkedList(40, x1[21]))))

(8) -> (22), if ((x2[8] →^* java.lang.Object(LinkedList(x2[22], x3[22])))∧(x3[8] →^* x4[22])∧(x1[8] →^* java.lang.Object(LinkedList(41, x1[22]))))

(8) -> (23), if ((x2[8] →^* x2[23])∧(x3[8] →^* x3[23])∧(x1[8] →^* java.lang.Object(LinkedList(42, x1[23]))))

(8) -> (24), if ((x2[8] →^* x2[24])∧(x3[8] →^* x3[24])∧(x1[8] →^* java.lang.Object(LinkedList(43, x1[24]))))

(8) -> (25), if ((x2[8] →^* x2[25])∧(x3[8] →^* x3[25])∧(x1[8] →^* java.lang.Object(LinkedList(45, x1[25]))))

(8) -> (26), if ((x2[8] →^* x2[26])∧(x3[8] →^* x3[26])∧(x1[8] →^* java.lang.Object(LinkedList(47, x1[26]))))

(9) -> (6), if ((x3[9] →^* x2[6])∧(java.lang.Object(LinkedList(x2[9], x4[9])) →^* x3[6])∧(x1[9] →^* java.lang.Object(LinkedList(x0[6], x1[6]))))

(9) -> (8), if ((x3[9] →^* x2[8])∧(java.lang.Object(LinkedList(x2[9], x4[9])) →^* x3[8])∧(x1[9] →^* java.lang.Object(LinkedList(40, x1[8]))))

(9) -> (9), if ((x3[9] →^* java.lang.Object(LinkedList(x2[9]', x3[9]')))∧(java.lang.Object(LinkedList(x2[9], x4[9])) →^* x4[9]')∧(x1[9] →^* java.lang.Object(LinkedList(41, x1[9]'))))

(9) -> (10), if ((x3[9] →^* x2[10])∧(java.lang.Object(LinkedList(x2[9], x4[9])) →^* x3[10])∧(x1[9] →^* java.lang.Object(LinkedList(42, x1[10]))))

(9) -> (11), if ((x3[9] →^* x2[11])∧(java.lang.Object(LinkedList(x2[9], x4[9])) →^* x3[11])∧(x1[9] →^* java.lang.Object(LinkedList(43, x1[11]))))

(9) -> (12), if ((x3[9] →^* x2[12])∧(java.lang.Object(LinkedList(x2[9], x4[9])) →^* x3[12])∧(x1[9] →^* java.lang.Object(LinkedList(44, x1[12]))))

(9) -> (13), if ((x3[9] →^* x2[13])∧(java.lang.Object(LinkedList(x2[9], x4[9])) →^* x3[13])∧(x1[9] →^* java.lang.Object(LinkedList(45, x1[13]))))

(9) -> (14), if ((x3[9] →^* x2[14])∧(java.lang.Object(LinkedList(x2[9], x4[9])) →^* x3[14])∧(x1[9] →^* java.lang.Object(LinkedList(46, x1[14]))))

(9) -> (15), if ((x3[9] →^* x2[15])∧(java.lang.Object(LinkedList(x2[9], x4[9])) →^* x3[15])∧(x1[9] →^* java.lang.Object(LinkedList(47, x1[15]))))

(9) -> (16), if ((x3[9] →^* x2[16])∧(java.lang.Object(LinkedList(x2[9], x4[9])) →^* x3[16])∧(x1[9] →^* java.lang.Object(LinkedList(x0[16], x1[16]))))

(9) -> (19), if ((x3[9] →^* x2[19])∧(java.lang.Object(LinkedList(x2[9], x4[9])) →^* x3[19])∧(x1[9] →^* java.lang.Object(LinkedList(44, x1[19]))))

(9) -> (20), if ((x3[9] →^* x2[20])∧(java.lang.Object(LinkedList(x2[9], x4[9])) →^* x3[20])∧(x1[9] →^* java.lang.Object(LinkedList(46, x1[20]))))

(9) -> (21), if ((x3[9] →^* x2[21])∧(java.lang.Object(LinkedList(x2[9], x4[9])) →^* x3[21])∧(x1[9] →^* java.lang.Object(LinkedList(40, x1[21]))))

(9) -> (22), if ((x3[9] →^* java.lang.Object(LinkedList(x2[22], x3[22])))∧(java.lang.Object(LinkedList(x2[9], x4[9])) →^* x4[22])∧(x1[9] →^* java.lang.Object(LinkedList(41, x1[22]))))

(9) -> (23), if ((x3[9] →^* x2[23])∧(java.lang.Object(LinkedList(x2[9], x4[9])) →^* x3[23])∧(x1[9] →^* java.lang.Object(LinkedList(42, x1[23]))))

(9) -> (24), if ((x3[9] →^* x2[24])∧(java.lang.Object(LinkedList(x2[9], x4[9])) →^* x3[24])∧(x1[9] →^* java.lang.Object(LinkedList(43, x1[24]))))

(9) -> (25), if ((x3[9] →^* x2[25])∧(java.lang.Object(LinkedList(x2[9], x4[9])) →^* x3[25])∧(x1[9] →^* java.lang.Object(LinkedList(45, x1[25]))))

(9) -> (26), if ((x3[9] →^* x2[26])∧(java.lang.Object(LinkedList(x2[9], x4[9])) →^* x3[26])∧(x1[9] →^* java.lang.Object(LinkedList(47, x1[26]))))

(10) -> (6), if ((java.lang.Object(LinkedList(42, x2[10])) →^* x2[6])∧(x3[10] →^* x3[6])∧(x1[10] →^* java.lang.Object(LinkedList(x0[6], x1[6]))))

(10) -> (8), if ((java.lang.Object(LinkedList(42, x2[10])) →^* x2[8])∧(x3[10] →^* x3[8])∧(x1[10] →^* java.lang.Object(LinkedList(40, x1[8]))))

(10) -> (9), if ((java.lang.Object(LinkedList(42, x2[10])) →^* java.lang.Object(LinkedList(x2[9], x3[9])))∧(x3[10] →^* x4[9])∧(x1[10] →^* java.lang.Object(LinkedList(41, x1[9]))))

(10) -> (10), if ((java.lang.Object(LinkedList(42, x2[10])) →^* x2[10]')∧(x3[10] →^* x3[10]')∧(x1[10] →^* java.lang.Object(LinkedList(42, x1[10]'))))

(10) -> (11), if ((java.lang.Object(LinkedList(42, x2[10])) →^* x2[11])∧(x3[10] →^* x3[11])∧(x1[10] →^* java.lang.Object(LinkedList(43, x1[11]))))

(10) -> (12), if ((java.lang.Object(LinkedList(42, x2[10])) →^* x2[12])∧(x3[10] →^* x3[12])∧(x1[10] →^* java.lang.Object(LinkedList(44, x1[12]))))

(10) -> (13), if ((java.lang.Object(LinkedList(42, x2[10])) →^* x2[13])∧(x3[10] →^* x3[13])∧(x1[10] →^* java.lang.Object(LinkedList(45, x1[13]))))

(10) -> (14), if ((java.lang.Object(LinkedList(42, x2[10])) →^* x2[14])∧(x3[10] →^* x3[14])∧(x1[10] →^* java.lang.Object(LinkedList(46, x1[14]))))

(10) -> (15), if ((java.lang.Object(LinkedList(42, x2[10])) →^* x2[15])∧(x3[10] →^* x3[15])∧(x1[10] →^* java.lang.Object(LinkedList(47, x1[15]))))

(10) -> (16), if ((java.lang.Object(LinkedList(42, x2[10])) →^* x2[16])∧(x3[10] →^* x3[16])∧(x1[10] →^* java.lang.Object(LinkedList(x0[16], x1[16]))))

(10) -> (19), if ((java.lang.Object(LinkedList(42, x2[10])) →^* x2[19])∧(x3[10] →^* x3[19])∧(x1[10] →^* java.lang.Object(LinkedList(44, x1[19]))))

(10) -> (20), if ((java.lang.Object(LinkedList(42, x2[10])) →^* x2[20])∧(x3[10] →^* x3[20])∧(x1[10] →^* java.lang.Object(LinkedList(46, x1[20]))))

(10) -> (21), if ((java.lang.Object(LinkedList(42, x2[10])) →^* x2[21])∧(x3[10] →^* x3[21])∧(x1[10] →^* java.lang.Object(LinkedList(40, x1[21]))))

(10) -> (22), if ((java.lang.Object(LinkedList(42, x2[10])) →^* java.lang.Object(LinkedList(x2[22], x3[22])))∧(x3[10] →^* x4[22])∧(x1[10] →^* java.lang.Object(LinkedList(41, x1[22]))))

(10) -> (23), if ((java.lang.Object(LinkedList(42, x2[10])) →^* x2[23])∧(x3[10] →^* x3[23])∧(x1[10] →^* java.lang.Object(LinkedList(42, x1[23]))))

(10) -> (24), if ((java.lang.Object(LinkedList(42, x2[10])) →^* x2[24])∧(x3[10] →^* x3[24])∧(x1[10] →^* java.lang.Object(LinkedList(43, x1[24]))))

(10) -> (25), if ((java.lang.Object(LinkedList(42, x2[10])) →^* x2[25])∧(x3[10] →^* x3[25])∧(x1[10] →^* java.lang.Object(LinkedList(45, x1[25]))))

(10) -> (26), if ((java.lang.Object(LinkedList(42, x2[10])) →^* x2[26])∧(x3[10] →^* x3[26])∧(x1[10] →^* java.lang.Object(LinkedList(47, x1[26]))))

(11) -> (6), if ((java.lang.Object(LinkedList(43, x2[11])) →^* x2[6])∧(x3[11] →^* x3[6])∧(x1[11] →^* java.lang.Object(LinkedList(x0[6], x1[6]))))

(11) -> (8), if ((java.lang.Object(LinkedList(43, x2[11])) →^* x2[8])∧(x3[11] →^* x3[8])∧(x1[11] →^* java.lang.Object(LinkedList(40, x1[8]))))

(11) -> (9), if ((java.lang.Object(LinkedList(43, x2[11])) →^* java.lang.Object(LinkedList(x2[9], x3[9])))∧(x3[11] →^* x4[9])∧(x1[11] →^* java.lang.Object(LinkedList(41, x1[9]))))

(11) -> (10), if ((java.lang.Object(LinkedList(43, x2[11])) →^* x2[10])∧(x3[11] →^* x3[10])∧(x1[11] →^* java.lang.Object(LinkedList(42, x1[10]))))

(11) -> (11), if ((java.lang.Object(LinkedList(43, x2[11])) →^* x2[11]')∧(x3[11] →^* x3[11]')∧(x1[11] →^* java.lang.Object(LinkedList(43, x1[11]'))))

(11) -> (12), if ((java.lang.Object(LinkedList(43, x2[11])) →^* x2[12])∧(x3[11] →^* x3[12])∧(x1[11] →^* java.lang.Object(LinkedList(44, x1[12]))))

(11) -> (13), if ((java.lang.Object(LinkedList(43, x2[11])) →^* x2[13])∧(x3[11] →^* x3[13])∧(x1[11] →^* java.lang.Object(LinkedList(45, x1[13]))))

(11) -> (14), if ((java.lang.Object(LinkedList(43, x2[11])) →^* x2[14])∧(x3[11] →^* x3[14])∧(x1[11] →^* java.lang.Object(LinkedList(46, x1[14]))))

(11) -> (15), if ((java.lang.Object(LinkedList(43, x2[11])) →^* x2[15])∧(x3[11] →^* x3[15])∧(x1[11] →^* java.lang.Object(LinkedList(47, x1[15]))))

(11) -> (16), if ((java.lang.Object(LinkedList(43, x2[11])) →^* x2[16])∧(x3[11] →^* x3[16])∧(x1[11] →^* java.lang.Object(LinkedList(x0[16], x1[16]))))

(11) -> (19), if ((java.lang.Object(LinkedList(43, x2[11])) →^* x2[19])∧(x3[11] →^* x3[19])∧(x1[11] →^* java.lang.Object(LinkedList(44, x1[19]))))

(11) -> (20), if ((java.lang.Object(LinkedList(43, x2[11])) →^* x2[20])∧(x3[11] →^* x3[20])∧(x1[11] →^* java.lang.Object(LinkedList(46, x1[20]))))

(11) -> (21), if ((java.lang.Object(LinkedList(43, x2[11])) →^* x2[21])∧(x3[11] →^* x3[21])∧(x1[11] →^* java.lang.Object(LinkedList(40, x1[21]))))

(11) -> (22), if ((java.lang.Object(LinkedList(43, x2[11])) →^* java.lang.Object(LinkedList(x2[22], x3[22])))∧(x3[11] →^* x4[22])∧(x1[11] →^* java.lang.Object(LinkedList(41, x1[22]))))

(11) -> (23), if ((java.lang.Object(LinkedList(43, x2[11])) →^* x2[23])∧(x3[11] →^* x3[23])∧(x1[11] →^* java.lang.Object(LinkedList(42, x1[23]))))

(11) -> (24), if ((java.lang.Object(LinkedList(43, x2[11])) →^* x2[24])∧(x3[11] →^* x3[24])∧(x1[11] →^* java.lang.Object(LinkedList(43, x1[24]))))

(11) -> (25), if ((java.lang.Object(LinkedList(43, x2[11])) →^* x2[25])∧(x3[11] →^* x3[25])∧(x1[11] →^* java.lang.Object(LinkedList(45, x1[25]))))

(11) -> (26), if ((java.lang.Object(LinkedList(43, x2[11])) →^* x2[26])∧(x3[11] →^* x3[26])∧(x1[11] →^* java.lang.Object(LinkedList(47, x1[26]))))

(12) -> (6), if ((x2[12] →^* x2[6])∧(java.lang.Object(LinkedList(44, x3[12])) →^* x3[6])∧(x1[12] →^* java.lang.Object(LinkedList(x0[6], x1[6]))))

(12) -> (8), if ((x2[12] →^* x2[8])∧(java.lang.Object(LinkedList(44, x3[12])) →^* x3[8])∧(x1[12] →^* java.lang.Object(LinkedList(40, x1[8]))))

(12) -> (9), if ((x2[12] →^* java.lang.Object(LinkedList(x2[9], x3[9])))∧(java.lang.Object(LinkedList(44, x3[12])) →^* x4[9])∧(x1[12] →^* java.lang.Object(LinkedList(41, x1[9]))))

(12) -> (10), if ((x2[12] →^* x2[10])∧(java.lang.Object(LinkedList(44, x3[12])) →^* x3[10])∧(x1[12] →^* java.lang.Object(LinkedList(42, x1[10]))))

(12) -> (11), if ((x2[12] →^* x2[11])∧(java.lang.Object(LinkedList(44, x3[12])) →^* x3[11])∧(x1[12] →^* java.lang.Object(LinkedList(43, x1[11]))))

(12) -> (12), if ((x2[12] →^* x2[12]')∧(java.lang.Object(LinkedList(44, x3[12])) →^* x3[12]')∧(x1[12] →^* java.lang.Object(LinkedList(44, x1[12]'))))

(12) -> (13), if ((x2[12] →^* x2[13])∧(java.lang.Object(LinkedList(44, x3[12])) →^* x3[13])∧(x1[12] →^* java.lang.Object(LinkedList(45, x1[13]))))

(12) -> (14), if ((x2[12] →^* x2[14])∧(java.lang.Object(LinkedList(44, x3[12])) →^* x3[14])∧(x1[12] →^* java.lang.Object(LinkedList(46, x1[14]))))

(12) -> (15), if ((x2[12] →^* x2[15])∧(java.lang.Object(LinkedList(44, x3[12])) →^* x3[15])∧(x1[12] →^* java.lang.Object(LinkedList(47, x1[15]))))

(12) -> (16), if ((x2[12] →^* x2[16])∧(java.lang.Object(LinkedList(44, x3[12])) →^* x3[16])∧(x1[12] →^* java.lang.Object(LinkedList(x0[16], x1[16]))))

(12) -> (19), if ((x2[12] →^* x2[19])∧(java.lang.Object(LinkedList(44, x3[12])) →^* x3[19])∧(x1[12] →^* java.lang.Object(LinkedList(44, x1[19]))))

(12) -> (20), if ((x2[12] →^* x2[20])∧(java.lang.Object(LinkedList(44, x3[12])) →^* x3[20])∧(x1[12] →^* java.lang.Object(LinkedList(46, x1[20]))))

(12) -> (21), if ((x2[12] →^* x2[21])∧(java.lang.Object(LinkedList(44, x3[12])) →^* x3[21])∧(x1[12] →^* java.lang.Object(LinkedList(40, x1[21]))))

(12) -> (22), if ((x2[12] →^* java.lang.Object(LinkedList(x2[22], x3[22])))∧(java.lang.Object(LinkedList(44, x3[12])) →^* x4[22])∧(x1[12] →^* java.lang.Object(LinkedList(41, x1[22]))))

(12) -> (23), if ((x2[12] →^* x2[23])∧(java.lang.Object(LinkedList(44, x3[12])) →^* x3[23])∧(x1[12] →^* java.lang.Object(LinkedList(42, x1[23]))))

(12) -> (24), if ((x2[12] →^* x2[24])∧(java.lang.Object(LinkedList(44, x3[12])) →^* x3[24])∧(x1[12] →^* java.lang.Object(LinkedList(43, x1[24]))))

(12) -> (25), if ((x2[12] →^* x2[25])∧(java.lang.Object(LinkedList(44, x3[12])) →^* x3[25])∧(x1[12] →^* java.lang.Object(LinkedList(45, x1[25]))))

(12) -> (26), if ((x2[12] →^* x2[26])∧(java.lang.Object(LinkedList(44, x3[12])) →^* x3[26])∧(x1[12] →^* java.lang.Object(LinkedList(47, x1[26]))))

(13) -> (6), if ((java.lang.Object(LinkedList(45, x2[13])) →^* x2[6])∧(x3[13] →^* x3[6])∧(x1[13] →^* java.lang.Object(LinkedList(x0[6], x1[6]))))

(13) -> (8), if ((java.lang.Object(LinkedList(45, x2[13])) →^* x2[8])∧(x3[13] →^* x3[8])∧(x1[13] →^* java.lang.Object(LinkedList(40, x1[8]))))

(13) -> (9), if ((java.lang.Object(LinkedList(45, x2[13])) →^* java.lang.Object(LinkedList(x2[9], x3[9])))∧(x3[13] →^* x4[9])∧(x1[13] →^* java.lang.Object(LinkedList(41, x1[9]))))

(13) -> (10), if ((java.lang.Object(LinkedList(45, x2[13])) →^* x2[10])∧(x3[13] →^* x3[10])∧(x1[13] →^* java.lang.Object(LinkedList(42, x1[10]))))

(13) -> (11), if ((java.lang.Object(LinkedList(45, x2[13])) →^* x2[11])∧(x3[13] →^* x3[11])∧(x1[13] →^* java.lang.Object(LinkedList(43, x1[11]))))

(13) -> (12), if ((java.lang.Object(LinkedList(45, x2[13])) →^* x2[12])∧(x3[13] →^* x3[12])∧(x1[13] →^* java.lang.Object(LinkedList(44, x1[12]))))

(13) -> (13), if ((java.lang.Object(LinkedList(45, x2[13])) →^* x2[13]')∧(x3[13] →^* x3[13]')∧(x1[13] →^* java.lang.Object(LinkedList(45, x1[13]'))))

(13) -> (14), if ((java.lang.Object(LinkedList(45, x2[13])) →^* x2[14])∧(x3[13] →^* x3[14])∧(x1[13] →^* java.lang.Object(LinkedList(46, x1[14]))))

(13) -> (15), if ((java.lang.Object(LinkedList(45, x2[13])) →^* x2[15])∧(x3[13] →^* x3[15])∧(x1[13] →^* java.lang.Object(LinkedList(47, x1[15]))))

(13) -> (16), if ((java.lang.Object(LinkedList(45, x2[13])) →^* x2[16])∧(x3[13] →^* x3[16])∧(x1[13] →^* java.lang.Object(LinkedList(x0[16], x1[16]))))

(13) -> (19), if ((java.lang.Object(LinkedList(45, x2[13])) →^* x2[19])∧(x3[13] →^* x3[19])∧(x1[13] →^* java.lang.Object(LinkedList(44, x1[19]))))

(13) -> (20), if ((java.lang.Object(LinkedList(45, x2[13])) →^* x2[20])∧(x3[13] →^* x3[20])∧(x1[13] →^* java.lang.Object(LinkedList(46, x1[20]))))

(13) -> (21), if ((java.lang.Object(LinkedList(45, x2[13])) →^* x2[21])∧(x3[13] →^* x3[21])∧(x1[13] →^* java.lang.Object(LinkedList(40, x1[21]))))

(13) -> (22), if ((java.lang.Object(LinkedList(45, x2[13])) →^* java.lang.Object(LinkedList(x2[22], x3[22])))∧(x3[13] →^* x4[22])∧(x1[13] →^* java.lang.Object(LinkedList(41, x1[22]))))

(13) -> (23), if ((java.lang.Object(LinkedList(45, x2[13])) →^* x2[23])∧(x3[13] →^* x3[23])∧(x1[13] →^* java.lang.Object(LinkedList(42, x1[23]))))

(13) -> (24), if ((java.lang.Object(LinkedList(45, x2[13])) →^* x2[24])∧(x3[13] →^* x3[24])∧(x1[13] →^* java.lang.Object(LinkedList(43, x1[24]))))

(13) -> (25), if ((java.lang.Object(LinkedList(45, x2[13])) →^* x2[25])∧(x3[13] →^* x3[25])∧(x1[13] →^* java.lang.Object(LinkedList(45, x1[25]))))

(13) -> (26), if ((java.lang.Object(LinkedList(45, x2[13])) →^* x2[26])∧(x3[13] →^* x3[26])∧(x1[13] →^* java.lang.Object(LinkedList(47, x1[26]))))

(14) -> (6), if ((x2[14] →^* x2[6])∧(java.lang.Object(LinkedList(46, x3[14])) →^* x3[6])∧(x1[14] →^* java.lang.Object(LinkedList(x0[6], x1[6]))))

(14) -> (8), if ((x2[14] →^* x2[8])∧(java.lang.Object(LinkedList(46, x3[14])) →^* x3[8])∧(x1[14] →^* java.lang.Object(LinkedList(40, x1[8]))))

(14) -> (9), if ((x2[14] →^* java.lang.Object(LinkedList(x2[9], x3[9])))∧(java.lang.Object(LinkedList(46, x3[14])) →^* x4[9])∧(x1[14] →^* java.lang.Object(LinkedList(41, x1[9]))))

(14) -> (10), if ((x2[14] →^* x2[10])∧(java.lang.Object(LinkedList(46, x3[14])) →^* x3[10])∧(x1[14] →^* java.lang.Object(LinkedList(42, x1[10]))))

(14) -> (11), if ((x2[14] →^* x2[11])∧(java.lang.Object(LinkedList(46, x3[14])) →^* x3[11])∧(x1[14] →^* java.lang.Object(LinkedList(43, x1[11]))))

(14) -> (12), if ((x2[14] →^* x2[12])∧(java.lang.Object(LinkedList(46, x3[14])) →^* x3[12])∧(x1[14] →^* java.lang.Object(LinkedList(44, x1[12]))))

(14) -> (13), if ((x2[14] →^* x2[13])∧(java.lang.Object(LinkedList(46, x3[14])) →^* x3[13])∧(x1[14] →^* java.lang.Object(LinkedList(45, x1[13]))))

(14) -> (14), if ((x2[14] →^* x2[14]')∧(java.lang.Object(LinkedList(46, x3[14])) →^* x3[14]')∧(x1[14] →^* java.lang.Object(LinkedList(46, x1[14]'))))

(14) -> (15), if ((x2[14] →^* x2[15])∧(java.lang.Object(LinkedList(46, x3[14])) →^* x3[15])∧(x1[14] →^* java.lang.Object(LinkedList(47, x1[15]))))

(14) -> (16), if ((x2[14] →^* x2[16])∧(java.lang.Object(LinkedList(46, x3[14])) →^* x3[16])∧(x1[14] →^* java.lang.Object(LinkedList(x0[16], x1[16]))))

(14) -> (19), if ((x2[14] →^* x2[19])∧(java.lang.Object(LinkedList(46, x3[14])) →^* x3[19])∧(x1[14] →^* java.lang.Object(LinkedList(44, x1[19]))))

(14) -> (20), if ((x2[14] →^* x2[20])∧(java.lang.Object(LinkedList(46, x3[14])) →^* x3[20])∧(x1[14] →^* java.lang.Object(LinkedList(46, x1[20]))))

(14) -> (21), if ((x2[14] →^* x2[21])∧(java.lang.Object(LinkedList(46, x3[14])) →^* x3[21])∧(x1[14] →^* java.lang.Object(LinkedList(40, x1[21]))))

(14) -> (22), if ((x2[14] →^* java.lang.Object(LinkedList(x2[22], x3[22])))∧(java.lang.Object(LinkedList(46, x3[14])) →^* x4[22])∧(x1[14] →^* java.lang.Object(LinkedList(41, x1[22]))))

(14) -> (23), if ((x2[14] →^* x2[23])∧(java.lang.Object(LinkedList(46, x3[14])) →^* x3[23])∧(x1[14] →^* java.lang.Object(LinkedList(42, x1[23]))))

(14) -> (24), if ((x2[14] →^* x2[24])∧(java.lang.Object(LinkedList(46, x3[14])) →^* x3[24])∧(x1[14] →^* java.lang.Object(LinkedList(43, x1[24]))))

(14) -> (25), if ((x2[14] →^* x2[25])∧(java.lang.Object(LinkedList(46, x3[14])) →^* x3[25])∧(x1[14] →^* java.lang.Object(LinkedList(45, x1[25]))))

(14) -> (26), if ((x2[14] →^* x2[26])∧(java.lang.Object(LinkedList(46, x3[14])) →^* x3[26])∧(x1[14] →^* java.lang.Object(LinkedList(47, x1[26]))))

(15) -> (6), if ((java.lang.Object(LinkedList(47, x2[15])) →^* x2[6])∧(x3[15] →^* x3[6])∧(x1[15] →^* java.lang.Object(LinkedList(x0[6], x1[6]))))

(15) -> (8), if ((java.lang.Object(LinkedList(47, x2[15])) →^* x2[8])∧(x3[15] →^* x3[8])∧(x1[15] →^* java.lang.Object(LinkedList(40, x1[8]))))

(15) -> (9), if ((java.lang.Object(LinkedList(47, x2[15])) →^* java.lang.Object(LinkedList(x2[9], x3[9])))∧(x3[15] →^* x4[9])∧(x1[15] →^* java.lang.Object(LinkedList(41, x1[9]))))

(15) -> (10), if ((java.lang.Object(LinkedList(47, x2[15])) →^* x2[10])∧(x3[15] →^* x3[10])∧(x1[15] →^* java.lang.Object(LinkedList(42, x1[10]))))

(15) -> (11), if ((java.lang.Object(LinkedList(47, x2[15])) →^* x2[11])∧(x3[15] →^* x3[11])∧(x1[15] →^* java.lang.Object(LinkedList(43, x1[11]))))

(15) -> (12), if ((java.lang.Object(LinkedList(47, x2[15])) →^* x2[12])∧(x3[15] →^* x3[12])∧(x1[15] →^* java.lang.Object(LinkedList(44, x1[12]))))

(15) -> (13), if ((java.lang.Object(LinkedList(47, x2[15])) →^* x2[13])∧(x3[15] →^* x3[13])∧(x1[15] →^* java.lang.Object(LinkedList(45, x1[13]))))

(15) -> (14), if ((java.lang.Object(LinkedList(47, x2[15])) →^* x2[14])∧(x3[15] →^* x3[14])∧(x1[15] →^* java.lang.Object(LinkedList(46, x1[14]))))

(15) -> (15), if ((java.lang.Object(LinkedList(47, x2[15])) →^* x2[15]')∧(x3[15] →^* x3[15]')∧(x1[15] →^* java.lang.Object(LinkedList(47, x1[15]'))))

(15) -> (16), if ((java.lang.Object(LinkedList(47, x2[15])) →^* x2[16])∧(x3[15] →^* x3[16])∧(x1[15] →^* java.lang.Object(LinkedList(x0[16], x1[16]))))

(15) -> (19), if ((java.lang.Object(LinkedList(47, x2[15])) →^* x2[19])∧(x3[15] →^* x3[19])∧(x1[15] →^* java.lang.Object(LinkedList(44, x1[19]))))

(15) -> (20), if ((java.lang.Object(LinkedList(47, x2[15])) →^* x2[20])∧(x3[15] →^* x3[20])∧(x1[15] →^* java.lang.Object(LinkedList(46, x1[20]))))

(15) -> (21), if ((java.lang.Object(LinkedList(47, x2[15])) →^* x2[21])∧(x3[15] →^* x3[21])∧(x1[15] →^* java.lang.Object(LinkedList(40, x1[21]))))

(15) -> (22), if ((java.lang.Object(LinkedList(47, x2[15])) →^* java.lang.Object(LinkedList(x2[22], x3[22])))∧(x3[15] →^* x4[22])∧(x1[15] →^* java.lang.Object(LinkedList(41, x1[22]))))

(15) -> (23), if ((java.lang.Object(LinkedList(47, x2[15])) →^* x2[23])∧(x3[15] →^* x3[23])∧(x1[15] →^* java.lang.Object(LinkedList(42, x1[23]))))

(15) -> (24), if ((java.lang.Object(LinkedList(47, x2[15])) →^* x2[24])∧(x3[15] →^* x3[24])∧(x1[15] →^* java.lang.Object(LinkedList(43, x1[24]))))

(15) -> (25), if ((java.lang.Object(LinkedList(47, x2[15])) →^* x2[25])∧(x3[15] →^* x3[25])∧(x1[15] →^* java.lang.Object(LinkedList(45, x1[25]))))

(15) -> (26), if ((java.lang.Object(LinkedList(47, x2[15])) →^* x2[26])∧(x3[15] →^* x3[26])∧(x1[15] →^* java.lang.Object(LinkedList(47, x1[26]))))

(16) -> (7), if ((x0[16] > 47 →^* TRUE)∧(x2[16] →^* x2[7])∧(x3[16] →^* x3[7])∧(java.lang.Object(LinkedList(x0[16], x1[16])) →^* java.lang.Object(LinkedList(x0[7], x1[7]))))

(17) -> (6), if ((x2[17] →^* x2[6])∧(java.lang.Object(LinkedList(44, x3[17])) →^* x3[6])∧(x1[17] →^* java.lang.Object(LinkedList(x0[6], x1[6]))))

(17) -> (8), if ((x2[17] →^* x2[8])∧(java.lang.Object(LinkedList(44, x3[17])) →^* x3[8])∧(x1[17] →^* java.lang.Object(LinkedList(40, x1[8]))))

(17) -> (9), if ((x2[17] →^* java.lang.Object(LinkedList(x2[9], x3[9])))∧(java.lang.Object(LinkedList(44, x3[17])) →^* x4[9])∧(x1[17] →^* java.lang.Object(LinkedList(41, x1[9]))))

(17) -> (10), if ((x2[17] →^* x2[10])∧(java.lang.Object(LinkedList(44, x3[17])) →^* x3[10])∧(x1[17] →^* java.lang.Object(LinkedList(42, x1[10]))))

(17) -> (11), if ((x2[17] →^* x2[11])∧(java.lang.Object(LinkedList(44, x3[17])) →^* x3[11])∧(x1[17] →^* java.lang.Object(LinkedList(43, x1[11]))))

(17) -> (12), if ((x2[17] →^* x2[12])∧(java.lang.Object(LinkedList(44, x3[17])) →^* x3[12])∧(x1[17] →^* java.lang.Object(LinkedList(44, x1[12]))))

(17) -> (13), if ((x2[17] →^* x2[13])∧(java.lang.Object(LinkedList(44, x3[17])) →^* x3[13])∧(x1[17] →^* java.lang.Object(LinkedList(45, x1[13]))))

(17) -> (14), if ((x2[17] →^* x2[14])∧(java.lang.Object(LinkedList(44, x3[17])) →^* x3[14])∧(x1[17] →^* java.lang.Object(LinkedList(46, x1[14]))))

(17) -> (15), if ((x2[17] →^* x2[15])∧(java.lang.Object(LinkedList(44, x3[17])) →^* x3[15])∧(x1[17] →^* java.lang.Object(LinkedList(47, x1[15]))))

(17) -> (16), if ((x2[17] →^* x2[16])∧(java.lang.Object(LinkedList(44, x3[17])) →^* x3[16])∧(x1[17] →^* java.lang.Object(LinkedList(x0[16], x1[16]))))

(17) -> (19), if ((x2[17] →^* x2[19])∧(java.lang.Object(LinkedList(44, x3[17])) →^* x3[19])∧(x1[17] →^* java.lang.Object(LinkedList(44, x1[19]))))

(17) -> (20), if ((x2[17] →^* x2[20])∧(java.lang.Object(LinkedList(44, x3[17])) →^* x3[20])∧(x1[17] →^* java.lang.Object(LinkedList(46, x1[20]))))

(17) -> (21), if ((x2[17] →^* x2[21])∧(java.lang.Object(LinkedList(44, x3[17])) →^* x3[21])∧(x1[17] →^* java.lang.Object(LinkedList(40, x1[21]))))

(17) -> (22), if ((x2[17] →^* java.lang.Object(LinkedList(x2[22], x3[22])))∧(java.lang.Object(LinkedList(44, x3[17])) →^* x4[22])∧(x1[17] →^* java.lang.Object(LinkedList(41, x1[22]))))

(17) -> (23), if ((x2[17] →^* x2[23])∧(java.lang.Object(LinkedList(44, x3[17])) →^* x3[23])∧(x1[17] →^* java.lang.Object(LinkedList(42, x1[23]))))

(17) -> (24), if ((x2[17] →^* x2[24])∧(java.lang.Object(LinkedList(44, x3[17])) →^* x3[24])∧(x1[17] →^* java.lang.Object(LinkedList(43, x1[24]))))

(17) -> (25), if ((x2[17] →^* x2[25])∧(java.lang.Object(LinkedList(44, x3[17])) →^* x3[25])∧(x1[17] →^* java.lang.Object(LinkedList(45, x1[25]))))

(17) -> (26), if ((x2[17] →^* x2[26])∧(java.lang.Object(LinkedList(44, x3[17])) →^* x3[26])∧(x1[17] →^* java.lang.Object(LinkedList(47, x1[26]))))

(18) -> (6), if ((x2[18] →^* x2[6])∧(java.lang.Object(LinkedList(46, x3[18])) →^* x3[6])∧(x1[18] →^* java.lang.Object(LinkedList(x0[6], x1[6]))))

(18) -> (8), if ((x2[18] →^* x2[8])∧(java.lang.Object(LinkedList(46, x3[18])) →^* x3[8])∧(x1[18] →^* java.lang.Object(LinkedList(40, x1[8]))))

(18) -> (9), if ((x2[18] →^* java.lang.Object(LinkedList(x2[9], x3[9])))∧(java.lang.Object(LinkedList(46, x3[18])) →^* x4[9])∧(x1[18] →^* java.lang.Object(LinkedList(41, x1[9]))))

(18) -> (10), if ((x2[18] →^* x2[10])∧(java.lang.Object(LinkedList(46, x3[18])) →^* x3[10])∧(x1[18] →^* java.lang.Object(LinkedList(42, x1[10]))))

(18) -> (11), if ((x2[18] →^* x2[11])∧(java.lang.Object(LinkedList(46, x3[18])) →^* x3[11])∧(x1[18] →^* java.lang.Object(LinkedList(43, x1[11]))))

(18) -> (12), if ((x2[18] →^* x2[12])∧(java.lang.Object(LinkedList(46, x3[18])) →^* x3[12])∧(x1[18] →^* java.lang.Object(LinkedList(44, x1[12]))))

(18) -> (13), if ((x2[18] →^* x2[13])∧(java.lang.Object(LinkedList(46, x3[18])) →^* x3[13])∧(x1[18] →^* java.lang.Object(LinkedList(45, x1[13]))))

(18) -> (14), if ((x2[18] →^* x2[14])∧(java.lang.Object(LinkedList(46, x3[18])) →^* x3[14])∧(x1[18] →^* java.lang.Object(LinkedList(46, x1[14]))))

(18) -> (15), if ((x2[18] →^* x2[15])∧(java.lang.Object(LinkedList(46, x3[18])) →^* x3[15])∧(x1[18] →^* java.lang.Object(LinkedList(47, x1[15]))))

(18) -> (16), if ((x2[18] →^* x2[16])∧(java.lang.Object(LinkedList(46, x3[18])) →^* x3[16])∧(x1[18] →^* java.lang.Object(LinkedList(x0[16], x1[16]))))

(18) -> (19), if ((x2[18] →^* x2[19])∧(java.lang.Object(LinkedList(46, x3[18])) →^* x3[19])∧(x1[18] →^* java.lang.Object(LinkedList(44, x1[19]))))

(18) -> (20), if ((x2[18] →^* x2[20])∧(java.lang.Object(LinkedList(46, x3[18])) →^* x3[20])∧(x1[18] →^* java.lang.Object(LinkedList(46, x1[20]))))

(18) -> (21), if ((x2[18] →^* x2[21])∧(java.lang.Object(LinkedList(46, x3[18])) →^* x3[21])∧(x1[18] →^* java.lang.Object(LinkedList(40, x1[21]))))

(18) -> (22), if ((x2[18] →^* java.lang.Object(LinkedList(x2[22], x3[22])))∧(java.lang.Object(LinkedList(46, x3[18])) →^* x4[22])∧(x1[18] →^* java.lang.Object(LinkedList(41, x1[22]))))

(18) -> (23), if ((x2[18] →^* x2[23])∧(java.lang.Object(LinkedList(46, x3[18])) →^* x3[23])∧(x1[18] →^* java.lang.Object(LinkedList(42, x1[23]))))

(18) -> (24), if ((x2[18] →^* x2[24])∧(java.lang.Object(LinkedList(46, x3[18])) →^* x3[24])∧(x1[18] →^* java.lang.Object(LinkedList(43, x1[24]))))

(18) -> (25), if ((x2[18] →^* x2[25])∧(java.lang.Object(LinkedList(46, x3[18])) →^* x3[25])∧(x1[18] →^* java.lang.Object(LinkedList(45, x1[25]))))

(18) -> (26), if ((x2[18] →^* x2[26])∧(java.lang.Object(LinkedList(46, x3[18])) →^* x3[26])∧(x1[18] →^* java.lang.Object(LinkedList(47, x1[26]))))

(19) -> (17), if ((java.lang.Object(LinkedList(44, x1[19])) →^* java.lang.Object(LinkedList(44, x1[17])))∧(x2[19] →^* x2[17])∧(x3[19] →^* x3[17]))

(20) -> (18), if ((java.lang.Object(LinkedList(46, x1[20])) →^* java.lang.Object(LinkedList(46, x1[18])))∧(x2[20] →^* x2[18])∧(x3[20] →^* x3[18]))

(21) -> (0), if ((x2[21] →^* x0[0])∧(x3[21] →^* x1[0])∧(x1[21] →^* x2[0]))

(22) -> (1), if ((x3[22] →^* x0[1])∧(java.lang.Object(LinkedList(x2[22], x4[22])) →^* java.lang.Object(LinkedList(x1[1], x2[1])))∧(x1[22] →^* x3[1]))

(23) -> (2), if ((java.lang.Object(LinkedList(42, x2[23])) →^* java.lang.Object(LinkedList(42, x1[2])))∧(x3[23] →^* x2[2])∧(x1[23] →^* x3[2]))

(24) -> (3), if ((java.lang.Object(LinkedList(43, x2[24])) →^* java.lang.Object(LinkedList(43, x1[3])))∧(x3[24] →^* x2[3])∧(x1[24] →^* x3[3]))

(25) -> (4), if ((java.lang.Object(LinkedList(45, x2[25])) →^* java.lang.Object(LinkedList(45, x1[4])))∧(x3[25] →^* x2[4])∧(x1[25] →^* x3[4]))

(26) -> (5), if ((java.lang.Object(LinkedList(47, x2[26])) →^* java.lang.Object(LinkedList(47, x1[5])))∧(x3[26] →^* x2[5])∧(x1[26] →^* x3[5]))

The set Q consists of the following terms:
6432_0_toPostfix_NULL(x0, x1, NULL)
8520_0_toPostfix_NULL(NULL)
8520_0_toPostfix_NULL(java.lang.Object(LinkedList(x0, x1)))

(15) IDPNonInfProof (SOUND transformation)

The constraints were generated the following way:
The DP Problem is simplified using the Induction Calculus [NONINF] with the following steps:
Note that final constraints are written in bold face.

For Pair 7120_0_TOPOSTFIX_STORE(x0, x1, x2) → 6432_0_TOPOSTFIX_NULL(x0, x1, x2) the following chains were created:

We consider the chain 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0]) → 6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0]), 6432_0_TOPOSTFIX_NULL(x2[6], x3[6], java.lang.Object(LinkedList(x0[6], x1[6]))) → COND_6432_0_TOPOSTFIX_NULL(<(x0[6], 40), x2[6], x3[6], java.lang.Object(LinkedList(x0[6], x1[6]))) which results in the following constraint:
(1)    (x0[0]=x2[6]∧x1[0]=x3[6]∧x2[0]=java.lang.Object(LinkedList(x0[6], x1[6])) ⇒ 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥NonInfC∧7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (1) using rules (III), (IV) which results in the following new constraint:
(2)    (7120_0_TOPOSTFIX_STORE(x0[0], x1[0], java.lang.Object(LinkedList(x0[6], x1[6])))≥NonInfC∧7120_0_TOPOSTFIX_STORE(x0[0], x1[0], java.lang.Object(LinkedList(x0[6], x1[6])))≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], java.lang.Object(LinkedList(x0[6], x1[6])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (2) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(3)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (3) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(4)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (4) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(5)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (5) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(6)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_56] ≥ 0)
We consider the chain 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0]) → 6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0]), 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8]))) → 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8]) which results in the following constraint:
(7)    (x0[0]=x2[8]∧x1[0]=x3[8]∧x2[0]=java.lang.Object(LinkedList(40, x1[8])) ⇒ 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥NonInfC∧7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (7) using rules (III), (IV) which results in the following new constraint:
(8)    (7120_0_TOPOSTFIX_STORE(x0[0], x1[0], java.lang.Object(LinkedList(40, x1[8])))≥NonInfC∧7120_0_TOPOSTFIX_STORE(x0[0], x1[0], java.lang.Object(LinkedList(40, x1[8])))≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], java.lang.Object(LinkedList(40, x1[8])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (8) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(9)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (9) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(10)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (10) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(11)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (11) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(12)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_56] ≥ 0)
We consider the chain 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0]) → 6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0]), 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9]))) → 6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9]) which results in the following constraint:
(13)    (x0[0]=java.lang.Object(LinkedList(x2[9], x3[9]))∧x1[0]=x4[9]∧x2[0]=java.lang.Object(LinkedList(41, x1[9])) ⇒ 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥NonInfC∧7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (13) using rules (III), (IV) which results in the following new constraint:
(14)    (7120_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(x2[9], x3[9])), x1[0], java.lang.Object(LinkedList(41, x1[9])))≥NonInfC∧7120_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(x2[9], x3[9])), x1[0], java.lang.Object(LinkedList(41, x1[9])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x1[0], java.lang.Object(LinkedList(41, x1[9])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (14) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(15)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (15) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(16)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (16) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(17)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (17) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(18)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_56] ≥ 0)
We consider the chain 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0]) → 6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0]), 6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10]) which results in the following constraint:
(19)    (x0[0]=x2[10]∧x1[0]=x3[10]∧x2[0]=java.lang.Object(LinkedList(42, x1[10])) ⇒ 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥NonInfC∧7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (19) using rules (III), (IV) which results in the following new constraint:
(20)    (7120_0_TOPOSTFIX_STORE(x0[0], x1[0], java.lang.Object(LinkedList(42, x1[10])))≥NonInfC∧7120_0_TOPOSTFIX_STORE(x0[0], x1[0], java.lang.Object(LinkedList(42, x1[10])))≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], java.lang.Object(LinkedList(42, x1[10])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (20) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(21)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (21) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(22)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (22) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(23)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (23) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(24)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_56] ≥ 0)
We consider the chain 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0]) → 6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0]), 6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11]) which results in the following constraint:
(25)    (x0[0]=x2[11]∧x1[0]=x3[11]∧x2[0]=java.lang.Object(LinkedList(43, x1[11])) ⇒ 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥NonInfC∧7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (25) using rules (III), (IV) which results in the following new constraint:
(26)    (7120_0_TOPOSTFIX_STORE(x0[0], x1[0], java.lang.Object(LinkedList(43, x1[11])))≥NonInfC∧7120_0_TOPOSTFIX_STORE(x0[0], x1[0], java.lang.Object(LinkedList(43, x1[11])))≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], java.lang.Object(LinkedList(43, x1[11])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (26) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(27)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (27) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(28)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (28) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(29)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (29) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(30)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_56] ≥ 0)
We consider the chain 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0]) → 6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0]), 6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12]))) → 6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12]) which results in the following constraint:
(31)    (x0[0]=x2[12]∧x1[0]=x3[12]∧x2[0]=java.lang.Object(LinkedList(44, x1[12])) ⇒ 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥NonInfC∧7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (31) using rules (III), (IV) which results in the following new constraint:
(32)    (7120_0_TOPOSTFIX_STORE(x0[0], x1[0], java.lang.Object(LinkedList(44, x1[12])))≥NonInfC∧7120_0_TOPOSTFIX_STORE(x0[0], x1[0], java.lang.Object(LinkedList(44, x1[12])))≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], java.lang.Object(LinkedList(44, x1[12])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (32) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(33)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (33) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(34)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (34) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(35)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (35) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(36)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_56] ≥ 0)
We consider the chain 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0]) → 6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0]), 6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13]) which results in the following constraint:
(37)    (x0[0]=x2[13]∧x1[0]=x3[13]∧x2[0]=java.lang.Object(LinkedList(45, x1[13])) ⇒ 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥NonInfC∧7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (37) using rules (III), (IV) which results in the following new constraint:
(38)    (7120_0_TOPOSTFIX_STORE(x0[0], x1[0], java.lang.Object(LinkedList(45, x1[13])))≥NonInfC∧7120_0_TOPOSTFIX_STORE(x0[0], x1[0], java.lang.Object(LinkedList(45, x1[13])))≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], java.lang.Object(LinkedList(45, x1[13])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (38) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(39)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (39) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(40)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (40) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(41)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (41) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(42)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_56] ≥ 0)
We consider the chain 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0]) → 6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0]), 6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14]))) → 6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14]) which results in the following constraint:
(43)    (x0[0]=x2[14]∧x1[0]=x3[14]∧x2[0]=java.lang.Object(LinkedList(46, x1[14])) ⇒ 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥NonInfC∧7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (43) using rules (III), (IV) which results in the following new constraint:
(44)    (7120_0_TOPOSTFIX_STORE(x0[0], x1[0], java.lang.Object(LinkedList(46, x1[14])))≥NonInfC∧7120_0_TOPOSTFIX_STORE(x0[0], x1[0], java.lang.Object(LinkedList(46, x1[14])))≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], java.lang.Object(LinkedList(46, x1[14])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (44) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(45)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (45) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(46)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (46) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(47)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (47) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(48)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_56] ≥ 0)
We consider the chain 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0]) → 6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0]), 6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15]) which results in the following constraint:
(49)    (x0[0]=x2[15]∧x1[0]=x3[15]∧x2[0]=java.lang.Object(LinkedList(47, x1[15])) ⇒ 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥NonInfC∧7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (49) using rules (III), (IV) which results in the following new constraint:
(50)    (7120_0_TOPOSTFIX_STORE(x0[0], x1[0], java.lang.Object(LinkedList(47, x1[15])))≥NonInfC∧7120_0_TOPOSTFIX_STORE(x0[0], x1[0], java.lang.Object(LinkedList(47, x1[15])))≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], java.lang.Object(LinkedList(47, x1[15])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (50) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(51)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (51) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(52)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (52) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(53)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (53) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(54)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_56] ≥ 0)
We consider the chain 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0]) → 6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0]), 6432_0_TOPOSTFIX_NULL(x2[16], x3[16], java.lang.Object(LinkedList(x0[16], x1[16]))) → COND_6432_0_TOPOSTFIX_NULL(>(x0[16], 47), x2[16], x3[16], java.lang.Object(LinkedList(x0[16], x1[16]))) which results in the following constraint:
(55)    (x0[0]=x2[16]∧x1[0]=x3[16]∧x2[0]=java.lang.Object(LinkedList(x0[16], x1[16])) ⇒ 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥NonInfC∧7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (55) using rules (III), (IV) which results in the following new constraint:
(56)    (7120_0_TOPOSTFIX_STORE(x0[0], x1[0], java.lang.Object(LinkedList(x0[16], x1[16])))≥NonInfC∧7120_0_TOPOSTFIX_STORE(x0[0], x1[0], java.lang.Object(LinkedList(x0[16], x1[16])))≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], java.lang.Object(LinkedList(x0[16], x1[16])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (56) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(57)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (57) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(58)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (58) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(59)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (59) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(60)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_56] ≥ 0)
We consider the chain 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0]) → 6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0]), 6432_0_TOPOSTFIX_NULL(x2[19], x3[19], java.lang.Object(LinkedList(44, x1[19]))) → 6715_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(44, x1[19])), x2[19], x3[19]) which results in the following constraint:
(61)    (x0[0]=x2[19]∧x1[0]=x3[19]∧x2[0]=java.lang.Object(LinkedList(44, x1[19])) ⇒ 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥NonInfC∧7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (61) using rules (III), (IV) which results in the following new constraint:
(62)    (7120_0_TOPOSTFIX_STORE(x0[0], x1[0], java.lang.Object(LinkedList(44, x1[19])))≥NonInfC∧7120_0_TOPOSTFIX_STORE(x0[0], x1[0], java.lang.Object(LinkedList(44, x1[19])))≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], java.lang.Object(LinkedList(44, x1[19])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (62) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(63)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (63) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(64)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (64) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(65)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (65) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(66)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_56] ≥ 0)
We consider the chain 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0]) → 6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0]), 6432_0_TOPOSTFIX_NULL(x2[20], x3[20], java.lang.Object(LinkedList(46, x1[20]))) → 6725_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(46, x1[20])), x2[20], x3[20]) which results in the following constraint:
(67)    (x0[0]=x2[20]∧x1[0]=x3[20]∧x2[0]=java.lang.Object(LinkedList(46, x1[20])) ⇒ 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥NonInfC∧7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (67) using rules (III), (IV) which results in the following new constraint:
(68)    (7120_0_TOPOSTFIX_STORE(x0[0], x1[0], java.lang.Object(LinkedList(46, x1[20])))≥NonInfC∧7120_0_TOPOSTFIX_STORE(x0[0], x1[0], java.lang.Object(LinkedList(46, x1[20])))≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], java.lang.Object(LinkedList(46, x1[20])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (68) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(69)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (69) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(70)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (70) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(71)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (71) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(72)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_56] ≥ 0)
We consider the chain 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0]) → 6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0]), 6432_0_TOPOSTFIX_NULL(x2[21], x3[21], java.lang.Object(LinkedList(40, x1[21]))) → 7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21]) which results in the following constraint:
(73)    (x0[0]=x2[21]∧x1[0]=x3[21]∧x2[0]=java.lang.Object(LinkedList(40, x1[21])) ⇒ 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥NonInfC∧7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (73) using rules (III), (IV) which results in the following new constraint:
(74)    (7120_0_TOPOSTFIX_STORE(x0[0], x1[0], java.lang.Object(LinkedList(40, x1[21])))≥NonInfC∧7120_0_TOPOSTFIX_STORE(x0[0], x1[0], java.lang.Object(LinkedList(40, x1[21])))≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], java.lang.Object(LinkedList(40, x1[21])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (74) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(75)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (75) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(76)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (76) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(77)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (77) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(78)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_56] ≥ 0)
We consider the chain 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0]) → 6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0]), 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x4[22], java.lang.Object(LinkedList(41, x1[22]))) → 8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22]) which results in the following constraint:
(79)    (x0[0]=java.lang.Object(LinkedList(x2[22], x3[22]))∧x1[0]=x4[22]∧x2[0]=java.lang.Object(LinkedList(41, x1[22])) ⇒ 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥NonInfC∧7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (79) using rules (III), (IV) which results in the following new constraint:
(80)    (7120_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(x2[22], x3[22])), x1[0], java.lang.Object(LinkedList(41, x1[22])))≥NonInfC∧7120_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(x2[22], x3[22])), x1[0], java.lang.Object(LinkedList(41, x1[22])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x1[0], java.lang.Object(LinkedList(41, x1[22])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (80) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(81)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (81) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(82)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (82) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(83)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (83) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(84)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_56] ≥ 0)
We consider the chain 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0]) → 6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0]), 6432_0_TOPOSTFIX_NULL(x2[23], x3[23], java.lang.Object(LinkedList(42, x1[23]))) → 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23]) which results in the following constraint:
(85)    (x0[0]=x2[23]∧x1[0]=x3[23]∧x2[0]=java.lang.Object(LinkedList(42, x1[23])) ⇒ 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥NonInfC∧7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (85) using rules (III), (IV) which results in the following new constraint:
(86)    (7120_0_TOPOSTFIX_STORE(x0[0], x1[0], java.lang.Object(LinkedList(42, x1[23])))≥NonInfC∧7120_0_TOPOSTFIX_STORE(x0[0], x1[0], java.lang.Object(LinkedList(42, x1[23])))≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], java.lang.Object(LinkedList(42, x1[23])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (86) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(87)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (87) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(88)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (88) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(89)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (89) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(90)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_56] ≥ 0)
We consider the chain 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0]) → 6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0]), 6432_0_TOPOSTFIX_NULL(x2[24], x3[24], java.lang.Object(LinkedList(43, x1[24]))) → 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24]) which results in the following constraint:
(91)    (x0[0]=x2[24]∧x1[0]=x3[24]∧x2[0]=java.lang.Object(LinkedList(43, x1[24])) ⇒ 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥NonInfC∧7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (91) using rules (III), (IV) which results in the following new constraint:
(92)    (7120_0_TOPOSTFIX_STORE(x0[0], x1[0], java.lang.Object(LinkedList(43, x1[24])))≥NonInfC∧7120_0_TOPOSTFIX_STORE(x0[0], x1[0], java.lang.Object(LinkedList(43, x1[24])))≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], java.lang.Object(LinkedList(43, x1[24])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (92) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(93)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (93) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(94)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (94) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(95)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (95) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(96)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_56] ≥ 0)
We consider the chain 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0]) → 6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0]), 6432_0_TOPOSTFIX_NULL(x2[25], x3[25], java.lang.Object(LinkedList(45, x1[25]))) → 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25]) which results in the following constraint:
(97)    (x0[0]=x2[25]∧x1[0]=x3[25]∧x2[0]=java.lang.Object(LinkedList(45, x1[25])) ⇒ 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥NonInfC∧7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (97) using rules (III), (IV) which results in the following new constraint:
(98)    (7120_0_TOPOSTFIX_STORE(x0[0], x1[0], java.lang.Object(LinkedList(45, x1[25])))≥NonInfC∧7120_0_TOPOSTFIX_STORE(x0[0], x1[0], java.lang.Object(LinkedList(45, x1[25])))≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], java.lang.Object(LinkedList(45, x1[25])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (98) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(99)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (99) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(100)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (100) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(101)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (101) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(102)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_56] ≥ 0)
We consider the chain 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0]) → 6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0]), 6432_0_TOPOSTFIX_NULL(x2[26], x3[26], java.lang.Object(LinkedList(47, x1[26]))) → 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26]) which results in the following constraint:
(103)    (x0[0]=x2[26]∧x1[0]=x3[26]∧x2[0]=java.lang.Object(LinkedList(47, x1[26])) ⇒ 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥NonInfC∧7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (103) using rules (III), (IV) which results in the following new constraint:
(104)    (7120_0_TOPOSTFIX_STORE(x0[0], x1[0], java.lang.Object(LinkedList(47, x1[26])))≥NonInfC∧7120_0_TOPOSTFIX_STORE(x0[0], x1[0], java.lang.Object(LinkedList(47, x1[26])))≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], java.lang.Object(LinkedList(47, x1[26])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (104) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(105)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (105) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(106)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (106) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(107)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (107) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(108)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_56] ≥ 0)

For Pair 8934_0_TOPOSTFIX_STORE(x0, java.lang.Object(LinkedList(x1, x2)), x3) → 6432_0_TOPOSTFIX_NULL(x0, java.lang.Object(LinkedList(x1, x2)), x3) the following chains were created:

We consider the chain 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]) → 6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]), 6432_0_TOPOSTFIX_NULL(x2[6], x3[6], java.lang.Object(LinkedList(x0[6], x1[6]))) → COND_6432_0_TOPOSTFIX_NULL(<(x0[6], 40), x2[6], x3[6], java.lang.Object(LinkedList(x0[6], x1[6]))) which results in the following constraint:
(109)    (x0[1]=x2[6]∧java.lang.Object(LinkedList(x1[1], x2[1]))=x3[6]∧x3[1]=java.lang.Object(LinkedList(x0[6], x1[6])) ⇒ 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥NonInfC∧8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (109) using rules (III), (IV) which results in the following new constraint:
(110)    (8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(x0[6], x1[6])))≥NonInfC∧8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(x0[6], x1[6])))≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(x0[6], x1[6])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (110) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(111)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (111) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(112)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (112) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(113)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (113) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(114)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_58] ≥ 0)
We consider the chain 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]) → 6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]), 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8]))) → 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8]) which results in the following constraint:
(115)    (x0[1]=x2[8]∧java.lang.Object(LinkedList(x1[1], x2[1]))=x3[8]∧x3[1]=java.lang.Object(LinkedList(40, x1[8])) ⇒ 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥NonInfC∧8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (115) using rules (III), (IV) which results in the following new constraint:
(116)    (8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(40, x1[8])))≥NonInfC∧8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(40, x1[8])))≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(40, x1[8])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (116) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(117)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (117) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(118)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (118) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(119)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (119) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(120)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_58] ≥ 0)
We consider the chain 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]) → 6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]), 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9]))) → 6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9]) which results in the following constraint:
(121)    (x0[1]=java.lang.Object(LinkedList(x2[9], x3[9]))∧java.lang.Object(LinkedList(x1[1], x2[1]))=x4[9]∧x3[1]=java.lang.Object(LinkedList(41, x1[9])) ⇒ 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥NonInfC∧8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (121) using rules (III), (IV) which results in the following new constraint:
(122)    (8934_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(x2[9], x3[9])), java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(41, x1[9])))≥NonInfC∧8934_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(x2[9], x3[9])), java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(41, x1[9])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(41, x1[9])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (122) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(123)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (123) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(124)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (124) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(125)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (125) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(126)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_58] ≥ 0)
We consider the chain 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]) → 6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]), 6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10]) which results in the following constraint:
(127)    (x0[1]=x2[10]∧java.lang.Object(LinkedList(x1[1], x2[1]))=x3[10]∧x3[1]=java.lang.Object(LinkedList(42, x1[10])) ⇒ 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥NonInfC∧8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (127) using rules (III), (IV) which results in the following new constraint:
(128)    (8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(42, x1[10])))≥NonInfC∧8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(42, x1[10])))≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(42, x1[10])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (128) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(129)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (129) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(130)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (130) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(131)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (131) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(132)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_58] ≥ 0)
We consider the chain 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]) → 6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]), 6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11]) which results in the following constraint:
(133)    (x0[1]=x2[11]∧java.lang.Object(LinkedList(x1[1], x2[1]))=x3[11]∧x3[1]=java.lang.Object(LinkedList(43, x1[11])) ⇒ 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥NonInfC∧8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (133) using rules (III), (IV) which results in the following new constraint:
(134)    (8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(43, x1[11])))≥NonInfC∧8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(43, x1[11])))≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(43, x1[11])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (134) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(135)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (135) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(136)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (136) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(137)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (137) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(138)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_58] ≥ 0)
We consider the chain 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]) → 6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]), 6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12]))) → 6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12]) which results in the following constraint:
(139)    (x0[1]=x2[12]∧java.lang.Object(LinkedList(x1[1], x2[1]))=x3[12]∧x3[1]=java.lang.Object(LinkedList(44, x1[12])) ⇒ 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥NonInfC∧8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (139) using rules (III), (IV) which results in the following new constraint:
(140)    (8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(44, x1[12])))≥NonInfC∧8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(44, x1[12])))≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(44, x1[12])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (140) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(141)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (141) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(142)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (142) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(143)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (143) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(144)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_58] ≥ 0)
We consider the chain 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]) → 6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]), 6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13]) which results in the following constraint:
(145)    (x0[1]=x2[13]∧java.lang.Object(LinkedList(x1[1], x2[1]))=x3[13]∧x3[1]=java.lang.Object(LinkedList(45, x1[13])) ⇒ 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥NonInfC∧8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (145) using rules (III), (IV) which results in the following new constraint:
(146)    (8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(45, x1[13])))≥NonInfC∧8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(45, x1[13])))≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(45, x1[13])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (146) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(147)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (147) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(148)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (148) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(149)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (149) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(150)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_58] ≥ 0)
We consider the chain 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]) → 6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]), 6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14]))) → 6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14]) which results in the following constraint:
(151)    (x0[1]=x2[14]∧java.lang.Object(LinkedList(x1[1], x2[1]))=x3[14]∧x3[1]=java.lang.Object(LinkedList(46, x1[14])) ⇒ 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥NonInfC∧8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (151) using rules (III), (IV) which results in the following new constraint:
(152)    (8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(46, x1[14])))≥NonInfC∧8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(46, x1[14])))≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(46, x1[14])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (152) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(153)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (153) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(154)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (154) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(155)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (155) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(156)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_58] ≥ 0)
We consider the chain 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]) → 6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]), 6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15]) which results in the following constraint:
(157)    (x0[1]=x2[15]∧java.lang.Object(LinkedList(x1[1], x2[1]))=x3[15]∧x3[1]=java.lang.Object(LinkedList(47, x1[15])) ⇒ 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥NonInfC∧8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (157) using rules (III), (IV) which results in the following new constraint:
(158)    (8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(47, x1[15])))≥NonInfC∧8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(47, x1[15])))≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(47, x1[15])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (158) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(159)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (159) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(160)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (160) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(161)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (161) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(162)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_58] ≥ 0)
We consider the chain 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]) → 6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]), 6432_0_TOPOSTFIX_NULL(x2[16], x3[16], java.lang.Object(LinkedList(x0[16], x1[16]))) → COND_6432_0_TOPOSTFIX_NULL(>(x0[16], 47), x2[16], x3[16], java.lang.Object(LinkedList(x0[16], x1[16]))) which results in the following constraint:
(163)    (x0[1]=x2[16]∧java.lang.Object(LinkedList(x1[1], x2[1]))=x3[16]∧x3[1]=java.lang.Object(LinkedList(x0[16], x1[16])) ⇒ 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥NonInfC∧8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (163) using rules (III), (IV) which results in the following new constraint:
(164)    (8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(x0[16], x1[16])))≥NonInfC∧8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(x0[16], x1[16])))≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(x0[16], x1[16])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (164) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(165)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (165) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(166)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (166) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(167)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (167) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(168)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_58] ≥ 0)
We consider the chain 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]) → 6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]), 6432_0_TOPOSTFIX_NULL(x2[19], x3[19], java.lang.Object(LinkedList(44, x1[19]))) → 6715_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(44, x1[19])), x2[19], x3[19]) which results in the following constraint:
(169)    (x0[1]=x2[19]∧java.lang.Object(LinkedList(x1[1], x2[1]))=x3[19]∧x3[1]=java.lang.Object(LinkedList(44, x1[19])) ⇒ 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥NonInfC∧8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (169) using rules (III), (IV) which results in the following new constraint:
(170)    (8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(44, x1[19])))≥NonInfC∧8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(44, x1[19])))≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(44, x1[19])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (170) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(171)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (171) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(172)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (172) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(173)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (173) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(174)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_58] ≥ 0)
We consider the chain 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]) → 6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]), 6432_0_TOPOSTFIX_NULL(x2[20], x3[20], java.lang.Object(LinkedList(46, x1[20]))) → 6725_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(46, x1[20])), x2[20], x3[20]) which results in the following constraint:
(175)    (x0[1]=x2[20]∧java.lang.Object(LinkedList(x1[1], x2[1]))=x3[20]∧x3[1]=java.lang.Object(LinkedList(46, x1[20])) ⇒ 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥NonInfC∧8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (175) using rules (III), (IV) which results in the following new constraint:
(176)    (8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(46, x1[20])))≥NonInfC∧8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(46, x1[20])))≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(46, x1[20])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (176) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(177)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (177) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(178)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (178) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(179)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (179) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(180)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_58] ≥ 0)
We consider the chain 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]) → 6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]), 6432_0_TOPOSTFIX_NULL(x2[21], x3[21], java.lang.Object(LinkedList(40, x1[21]))) → 7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21]) which results in the following constraint:
(181)    (x0[1]=x2[21]∧java.lang.Object(LinkedList(x1[1], x2[1]))=x3[21]∧x3[1]=java.lang.Object(LinkedList(40, x1[21])) ⇒ 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥NonInfC∧8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (181) using rules (III), (IV) which results in the following new constraint:
(182)    (8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(40, x1[21])))≥NonInfC∧8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(40, x1[21])))≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(40, x1[21])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (182) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(183)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (183) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(184)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (184) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(185)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (185) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(186)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_58] ≥ 0)
We consider the chain 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]) → 6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]), 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x4[22], java.lang.Object(LinkedList(41, x1[22]))) → 8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22]) which results in the following constraint:
(187)    (x0[1]=java.lang.Object(LinkedList(x2[22], x3[22]))∧java.lang.Object(LinkedList(x1[1], x2[1]))=x4[22]∧x3[1]=java.lang.Object(LinkedList(41, x1[22])) ⇒ 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥NonInfC∧8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (187) using rules (III), (IV) which results in the following new constraint:
(188)    (8934_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(x2[22], x3[22])), java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(41, x1[22])))≥NonInfC∧8934_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(x2[22], x3[22])), java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(41, x1[22])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(41, x1[22])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (188) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(189)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (189) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(190)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (190) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(191)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (191) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(192)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_58] ≥ 0)
We consider the chain 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]) → 6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]), 6432_0_TOPOSTFIX_NULL(x2[23], x3[23], java.lang.Object(LinkedList(42, x1[23]))) → 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23]) which results in the following constraint:
(193)    (x0[1]=x2[23]∧java.lang.Object(LinkedList(x1[1], x2[1]))=x3[23]∧x3[1]=java.lang.Object(LinkedList(42, x1[23])) ⇒ 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥NonInfC∧8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (193) using rules (III), (IV) which results in the following new constraint:
(194)    (8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(42, x1[23])))≥NonInfC∧8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(42, x1[23])))≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(42, x1[23])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (194) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(195)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (195) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(196)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (196) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(197)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (197) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(198)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_58] ≥ 0)
We consider the chain 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]) → 6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]), 6432_0_TOPOSTFIX_NULL(x2[24], x3[24], java.lang.Object(LinkedList(43, x1[24]))) → 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24]) which results in the following constraint:
(199)    (x0[1]=x2[24]∧java.lang.Object(LinkedList(x1[1], x2[1]))=x3[24]∧x3[1]=java.lang.Object(LinkedList(43, x1[24])) ⇒ 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥NonInfC∧8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (199) using rules (III), (IV) which results in the following new constraint:
(200)    (8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(43, x1[24])))≥NonInfC∧8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(43, x1[24])))≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(43, x1[24])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (200) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(201)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (201) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(202)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (202) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(203)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (203) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(204)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_58] ≥ 0)
We consider the chain 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]) → 6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]), 6432_0_TOPOSTFIX_NULL(x2[25], x3[25], java.lang.Object(LinkedList(45, x1[25]))) → 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25]) which results in the following constraint:
(205)    (x0[1]=x2[25]∧java.lang.Object(LinkedList(x1[1], x2[1]))=x3[25]∧x3[1]=java.lang.Object(LinkedList(45, x1[25])) ⇒ 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥NonInfC∧8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (205) using rules (III), (IV) which results in the following new constraint:
(206)    (8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(45, x1[25])))≥NonInfC∧8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(45, x1[25])))≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(45, x1[25])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (206) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(207)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (207) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(208)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (208) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(209)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (209) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(210)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_58] ≥ 0)
We consider the chain 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]) → 6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]), 6432_0_TOPOSTFIX_NULL(x2[26], x3[26], java.lang.Object(LinkedList(47, x1[26]))) → 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26]) which results in the following constraint:
(211)    (x0[1]=x2[26]∧java.lang.Object(LinkedList(x1[1], x2[1]))=x3[26]∧x3[1]=java.lang.Object(LinkedList(47, x1[26])) ⇒ 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥NonInfC∧8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (211) using rules (III), (IV) which results in the following new constraint:
(212)    (8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(47, x1[26])))≥NonInfC∧8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(47, x1[26])))≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(47, x1[26])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (212) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(213)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (213) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(214)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (214) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(215)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (215) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(216)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_58] ≥ 0)

For Pair 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1)), x2, x3) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1)), x2, x3) the following chains were created:

We consider the chain 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]), 6432_0_TOPOSTFIX_NULL(x2[6], x3[6], java.lang.Object(LinkedList(x0[6], x1[6]))) → COND_6432_0_TOPOSTFIX_NULL(<(x0[6], 40), x2[6], x3[6], java.lang.Object(LinkedList(x0[6], x1[6]))) which results in the following constraint:
(217)    (java.lang.Object(LinkedList(42, x1[2]))=x2[6]∧x2[2]=x3[6]∧x3[2]=java.lang.Object(LinkedList(x0[6], x1[6])) ⇒ 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (217) using rules (III), (IV) which results in the following new constraint:
(218)    (8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(x0[6], x1[6])))≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(x0[6], x1[6])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(x0[6], x1[6])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (218) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(219)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[3 + (-1)bso_60] + [4]x1[6] + [6]x0[6] ≥ 0)

We simplified constraint (219) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(220)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[3 + (-1)bso_60] + [4]x1[6] + [6]x0[6] ≥ 0)

We simplified constraint (220) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(221)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[3 + (-1)bso_60] + [4]x1[6] + [6]x0[6] ≥ 0)

We simplified constraint (221) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(222)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧0 ≥ 0∧0 ≥ 0∧[3 + (-1)bso_60] ≥ 0∧[1] ≥ 0∧[1] ≥ 0)
We consider the chain 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]), 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8]))) → 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8]) which results in the following constraint:
(223)    (java.lang.Object(LinkedList(42, x1[2]))=x2[8]∧x2[2]=x3[8]∧x3[2]=java.lang.Object(LinkedList(40, x1[8])) ⇒ 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (223) using rules (III), (IV) which results in the following new constraint:
(224)    (8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(40, x1[8])))≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(40, x1[8])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(40, x1[8])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (224) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(225)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[243 + (-1)bso_60] + [4]x1[8] ≥ 0)

We simplified constraint (225) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(226)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[243 + (-1)bso_60] + [4]x1[8] ≥ 0)

We simplified constraint (226) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(227)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[243 + (-1)bso_60] + [4]x1[8] ≥ 0)

We simplified constraint (227) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(228)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧0 ≥ 0∧0 ≥ 0∧[243 + (-1)bso_60] ≥ 0∧[1] ≥ 0)
We consider the chain 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]), 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9]))) → 6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9]) which results in the following constraint:
(229)    (java.lang.Object(LinkedList(42, x1[2]))=java.lang.Object(LinkedList(x2[9], x3[9]))∧x2[2]=x4[9]∧x3[2]=java.lang.Object(LinkedList(41, x1[9])) ⇒ 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (229) using rules (I), (II), (III), (IV) which results in the following new constraint:
(230)    (8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(41, x1[9])))≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(41, x1[9])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(41, x1[9])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (230) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(231)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[249 + (-1)bso_60] + [4]x1[9] ≥ 0)

We simplified constraint (231) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(232)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[249 + (-1)bso_60] + [4]x1[9] ≥ 0)

We simplified constraint (232) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(233)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[249 + (-1)bso_60] + [4]x1[9] ≥ 0)

We simplified constraint (233) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(234)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧0 ≥ 0∧0 ≥ 0∧[249 + (-1)bso_60] ≥ 0∧[1] ≥ 0)
We consider the chain 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]), 6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10]) which results in the following constraint:
(235)    (java.lang.Object(LinkedList(42, x1[2]))=x2[10]∧x2[2]=x3[10]∧x3[2]=java.lang.Object(LinkedList(42, x1[10])) ⇒ 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (235) using rules (III), (IV) which results in the following new constraint:
(236)    (8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(42, x1[10])))≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(42, x1[10])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(42, x1[10])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (236) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(237)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[255 + (-1)bso_60] + [4]x1[10] ≥ 0)

We simplified constraint (237) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(238)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[255 + (-1)bso_60] + [4]x1[10] ≥ 0)

We simplified constraint (238) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(239)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[255 + (-1)bso_60] + [4]x1[10] ≥ 0)

We simplified constraint (239) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(240)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧0 ≥ 0∧0 ≥ 0∧[255 + (-1)bso_60] ≥ 0∧[1] ≥ 0)
We consider the chain 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]), 6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11]) which results in the following constraint:
(241)    (java.lang.Object(LinkedList(42, x1[2]))=x2[11]∧x2[2]=x3[11]∧x3[2]=java.lang.Object(LinkedList(43, x1[11])) ⇒ 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (241) using rules (III), (IV) which results in the following new constraint:
(242)    (8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(43, x1[11])))≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(43, x1[11])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(43, x1[11])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (242) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(243)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[261 + (-1)bso_60] + [4]x1[11] ≥ 0)

We simplified constraint (243) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(244)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[261 + (-1)bso_60] + [4]x1[11] ≥ 0)

We simplified constraint (244) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(245)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[261 + (-1)bso_60] + [4]x1[11] ≥ 0)

We simplified constraint (245) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(246)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧0 ≥ 0∧0 ≥ 0∧[261 + (-1)bso_60] ≥ 0∧[1] ≥ 0)
We consider the chain 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]), 6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12]))) → 6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12]) which results in the following constraint:
(247)    (java.lang.Object(LinkedList(42, x1[2]))=x2[12]∧x2[2]=x3[12]∧x3[2]=java.lang.Object(LinkedList(44, x1[12])) ⇒ 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (247) using rules (III), (IV) which results in the following new constraint:
(248)    (8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(44, x1[12])))≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(44, x1[12])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(44, x1[12])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (248) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(249)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[267 + (-1)bso_60] + [4]x1[12] ≥ 0)

We simplified constraint (249) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(250)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[267 + (-1)bso_60] + [4]x1[12] ≥ 0)

We simplified constraint (250) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(251)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[267 + (-1)bso_60] + [4]x1[12] ≥ 0)

We simplified constraint (251) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(252)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧0 ≥ 0∧0 ≥ 0∧[267 + (-1)bso_60] ≥ 0∧[1] ≥ 0)
We consider the chain 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]), 6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13]) which results in the following constraint:
(253)    (java.lang.Object(LinkedList(42, x1[2]))=x2[13]∧x2[2]=x3[13]∧x3[2]=java.lang.Object(LinkedList(45, x1[13])) ⇒ 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (253) using rules (III), (IV) which results in the following new constraint:
(254)    (8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(45, x1[13])))≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(45, x1[13])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(45, x1[13])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (254) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(255)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[273 + (-1)bso_60] + [4]x1[13] ≥ 0)

We simplified constraint (255) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(256)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[273 + (-1)bso_60] + [4]x1[13] ≥ 0)

We simplified constraint (256) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(257)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[273 + (-1)bso_60] + [4]x1[13] ≥ 0)

We simplified constraint (257) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(258)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧0 ≥ 0∧0 ≥ 0∧[273 + (-1)bso_60] ≥ 0∧[1] ≥ 0)
We consider the chain 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]), 6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14]))) → 6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14]) which results in the following constraint:
(259)    (java.lang.Object(LinkedList(42, x1[2]))=x2[14]∧x2[2]=x3[14]∧x3[2]=java.lang.Object(LinkedList(46, x1[14])) ⇒ 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (259) using rules (III), (IV) which results in the following new constraint:
(260)    (8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(46, x1[14])))≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(46, x1[14])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(46, x1[14])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (260) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(261)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[279 + (-1)bso_60] + [4]x1[14] ≥ 0)

We simplified constraint (261) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(262)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[279 + (-1)bso_60] + [4]x1[14] ≥ 0)

We simplified constraint (262) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(263)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[279 + (-1)bso_60] + [4]x1[14] ≥ 0)

We simplified constraint (263) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(264)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧0 ≥ 0∧0 ≥ 0∧[279 + (-1)bso_60] ≥ 0∧[1] ≥ 0)
We consider the chain 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]), 6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15]) which results in the following constraint:
(265)    (java.lang.Object(LinkedList(42, x1[2]))=x2[15]∧x2[2]=x3[15]∧x3[2]=java.lang.Object(LinkedList(47, x1[15])) ⇒ 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (265) using rules (III), (IV) which results in the following new constraint:
(266)    (8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(47, x1[15])))≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(47, x1[15])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(47, x1[15])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (266) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(267)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[285 + (-1)bso_60] + [4]x1[15] ≥ 0)

We simplified constraint (267) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(268)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[285 + (-1)bso_60] + [4]x1[15] ≥ 0)

We simplified constraint (268) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(269)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[285 + (-1)bso_60] + [4]x1[15] ≥ 0)

We simplified constraint (269) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(270)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧0 ≥ 0∧0 ≥ 0∧[285 + (-1)bso_60] ≥ 0∧[1] ≥ 0)
We consider the chain 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]), 6432_0_TOPOSTFIX_NULL(x2[16], x3[16], java.lang.Object(LinkedList(x0[16], x1[16]))) → COND_6432_0_TOPOSTFIX_NULL(>(x0[16], 47), x2[16], x3[16], java.lang.Object(LinkedList(x0[16], x1[16]))) which results in the following constraint:
(271)    (java.lang.Object(LinkedList(42, x1[2]))=x2[16]∧x2[2]=x3[16]∧x3[2]=java.lang.Object(LinkedList(x0[16], x1[16])) ⇒ 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (271) using rules (III), (IV) which results in the following new constraint:
(272)    (8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(x0[16], x1[16])))≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(x0[16], x1[16])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(x0[16], x1[16])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (272) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(273)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[3 + (-1)bso_60] + [4]x1[16] + [6]x0[16] ≥ 0)

We simplified constraint (273) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(274)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[3 + (-1)bso_60] + [4]x1[16] + [6]x0[16] ≥ 0)

We simplified constraint (274) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(275)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[3 + (-1)bso_60] + [4]x1[16] + [6]x0[16] ≥ 0)

We simplified constraint (275) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(276)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧0 ≥ 0∧0 ≥ 0∧[3 + (-1)bso_60] ≥ 0∧[1] ≥ 0∧[1] ≥ 0)
We consider the chain 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]), 6432_0_TOPOSTFIX_NULL(x2[19], x3[19], java.lang.Object(LinkedList(44, x1[19]))) → 6715_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(44, x1[19])), x2[19], x3[19]) which results in the following constraint:
(277)    (java.lang.Object(LinkedList(42, x1[2]))=x2[19]∧x2[2]=x3[19]∧x3[2]=java.lang.Object(LinkedList(44, x1[19])) ⇒ 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (277) using rules (III), (IV) which results in the following new constraint:
(278)    (8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(44, x1[19])))≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(44, x1[19])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(44, x1[19])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (278) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(279)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[267 + (-1)bso_60] + [4]x1[19] ≥ 0)

We simplified constraint (279) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(280)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[267 + (-1)bso_60] + [4]x1[19] ≥ 0)

We simplified constraint (280) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(281)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[267 + (-1)bso_60] + [4]x1[19] ≥ 0)

We simplified constraint (281) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(282)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧0 ≥ 0∧0 ≥ 0∧[267 + (-1)bso_60] ≥ 0∧[1] ≥ 0)
We consider the chain 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]), 6432_0_TOPOSTFIX_NULL(x2[20], x3[20], java.lang.Object(LinkedList(46, x1[20]))) → 6725_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(46, x1[20])), x2[20], x3[20]) which results in the following constraint:
(283)    (java.lang.Object(LinkedList(42, x1[2]))=x2[20]∧x2[2]=x3[20]∧x3[2]=java.lang.Object(LinkedList(46, x1[20])) ⇒ 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (283) using rules (III), (IV) which results in the following new constraint:
(284)    (8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(46, x1[20])))≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(46, x1[20])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(46, x1[20])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (284) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(285)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[279 + (-1)bso_60] + [4]x1[20] ≥ 0)

We simplified constraint (285) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(286)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[279 + (-1)bso_60] + [4]x1[20] ≥ 0)

We simplified constraint (286) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(287)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[279 + (-1)bso_60] + [4]x1[20] ≥ 0)

We simplified constraint (287) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(288)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧0 ≥ 0∧0 ≥ 0∧[279 + (-1)bso_60] ≥ 0∧[1] ≥ 0)
We consider the chain 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]), 6432_0_TOPOSTFIX_NULL(x2[21], x3[21], java.lang.Object(LinkedList(40, x1[21]))) → 7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21]) which results in the following constraint:
(289)    (java.lang.Object(LinkedList(42, x1[2]))=x2[21]∧x2[2]=x3[21]∧x3[2]=java.lang.Object(LinkedList(40, x1[21])) ⇒ 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (289) using rules (III), (IV) which results in the following new constraint:
(290)    (8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(40, x1[21])))≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(40, x1[21])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(40, x1[21])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (290) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(291)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[243 + (-1)bso_60] + [4]x1[21] ≥ 0)

We simplified constraint (291) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(292)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[243 + (-1)bso_60] + [4]x1[21] ≥ 0)

We simplified constraint (292) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(293)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[243 + (-1)bso_60] + [4]x1[21] ≥ 0)

We simplified constraint (293) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(294)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧0 ≥ 0∧0 ≥ 0∧[243 + (-1)bso_60] ≥ 0∧[1] ≥ 0)
We consider the chain 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]), 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x4[22], java.lang.Object(LinkedList(41, x1[22]))) → 8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22]) which results in the following constraint:
(295)    (java.lang.Object(LinkedList(42, x1[2]))=java.lang.Object(LinkedList(x2[22], x3[22]))∧x2[2]=x4[22]∧x3[2]=java.lang.Object(LinkedList(41, x1[22])) ⇒ 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (295) using rules (I), (II), (III), (IV) which results in the following new constraint:
(296)    (8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(41, x1[22])))≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(41, x1[22])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(41, x1[22])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (296) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(297)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[249 + (-1)bso_60] + [4]x1[22] ≥ 0)

We simplified constraint (297) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(298)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[249 + (-1)bso_60] + [4]x1[22] ≥ 0)

We simplified constraint (298) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(299)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[249 + (-1)bso_60] + [4]x1[22] ≥ 0)

We simplified constraint (299) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(300)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧0 ≥ 0∧0 ≥ 0∧[249 + (-1)bso_60] ≥ 0∧[1] ≥ 0)
We consider the chain 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]), 6432_0_TOPOSTFIX_NULL(x2[23], x3[23], java.lang.Object(LinkedList(42, x1[23]))) → 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23]) which results in the following constraint:
(301)    (java.lang.Object(LinkedList(42, x1[2]))=x2[23]∧x2[2]=x3[23]∧x3[2]=java.lang.Object(LinkedList(42, x1[23])) ⇒ 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (301) using rules (III), (IV) which results in the following new constraint:
(302)    (8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(42, x1[23])))≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(42, x1[23])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(42, x1[23])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (302) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(303)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[255 + (-1)bso_60] + [4]x1[23] ≥ 0)

We simplified constraint (303) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(304)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[255 + (-1)bso_60] + [4]x1[23] ≥ 0)

We simplified constraint (304) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(305)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[255 + (-1)bso_60] + [4]x1[23] ≥ 0)

We simplified constraint (305) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(306)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧0 ≥ 0∧0 ≥ 0∧[255 + (-1)bso_60] ≥ 0∧[1] ≥ 0)
We consider the chain 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]), 6432_0_TOPOSTFIX_NULL(x2[24], x3[24], java.lang.Object(LinkedList(43, x1[24]))) → 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24]) which results in the following constraint:
(307)    (java.lang.Object(LinkedList(42, x1[2]))=x2[24]∧x2[2]=x3[24]∧x3[2]=java.lang.Object(LinkedList(43, x1[24])) ⇒ 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (307) using rules (III), (IV) which results in the following new constraint:
(308)    (8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(43, x1[24])))≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(43, x1[24])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(43, x1[24])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (308) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(309)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[261 + (-1)bso_60] + [4]x1[24] ≥ 0)

We simplified constraint (309) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(310)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[261 + (-1)bso_60] + [4]x1[24] ≥ 0)

We simplified constraint (310) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(311)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[261 + (-1)bso_60] + [4]x1[24] ≥ 0)

We simplified constraint (311) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(312)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧0 ≥ 0∧0 ≥ 0∧[261 + (-1)bso_60] ≥ 0∧[1] ≥ 0)
We consider the chain 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]), 6432_0_TOPOSTFIX_NULL(x2[25], x3[25], java.lang.Object(LinkedList(45, x1[25]))) → 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25]) which results in the following constraint:
(313)    (java.lang.Object(LinkedList(42, x1[2]))=x2[25]∧x2[2]=x3[25]∧x3[2]=java.lang.Object(LinkedList(45, x1[25])) ⇒ 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (313) using rules (III), (IV) which results in the following new constraint:
(314)    (8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(45, x1[25])))≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(45, x1[25])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(45, x1[25])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (314) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(315)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[273 + (-1)bso_60] + [4]x1[25] ≥ 0)

We simplified constraint (315) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(316)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[273 + (-1)bso_60] + [4]x1[25] ≥ 0)

We simplified constraint (316) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(317)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[273 + (-1)bso_60] + [4]x1[25] ≥ 0)

We simplified constraint (317) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(318)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧0 ≥ 0∧0 ≥ 0∧[273 + (-1)bso_60] ≥ 0∧[1] ≥ 0)
We consider the chain 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]), 6432_0_TOPOSTFIX_NULL(x2[26], x3[26], java.lang.Object(LinkedList(47, x1[26]))) → 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26]) which results in the following constraint:
(319)    (java.lang.Object(LinkedList(42, x1[2]))=x2[26]∧x2[2]=x3[26]∧x3[2]=java.lang.Object(LinkedList(47, x1[26])) ⇒ 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (319) using rules (III), (IV) which results in the following new constraint:
(320)    (8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(47, x1[26])))≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(47, x1[26])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(47, x1[26])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (320) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(321)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[285 + (-1)bso_60] + [4]x1[26] ≥ 0)

We simplified constraint (321) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(322)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[285 + (-1)bso_60] + [4]x1[26] ≥ 0)

We simplified constraint (322) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(323)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[285 + (-1)bso_60] + [4]x1[26] ≥ 0)

We simplified constraint (323) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(324)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧0 ≥ 0∧0 ≥ 0∧[285 + (-1)bso_60] ≥ 0∧[1] ≥ 0)

For Pair 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1)), x2, x3) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1)), x2, x3) the following chains were created:

We consider the chain 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]), 6432_0_TOPOSTFIX_NULL(x2[6], x3[6], java.lang.Object(LinkedList(x0[6], x1[6]))) → COND_6432_0_TOPOSTFIX_NULL(<(x0[6], 40), x2[6], x3[6], java.lang.Object(LinkedList(x0[6], x1[6]))) which results in the following constraint:
(325)    (java.lang.Object(LinkedList(43, x1[3]))=x2[6]∧x2[3]=x3[6]∧x3[3]=java.lang.Object(LinkedList(x0[6], x1[6])) ⇒ 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (325) using rules (III), (IV) which results in the following new constraint:
(326)    (8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(x0[6], x1[6])))≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(x0[6], x1[6])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(x0[6], x1[6])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (326) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(327)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (327) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(328)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (328) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(329)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (329) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(330)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_62] ≥ 0)
We consider the chain 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]), 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8]))) → 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8]) which results in the following constraint:
(331)    (java.lang.Object(LinkedList(43, x1[3]))=x2[8]∧x2[3]=x3[8]∧x3[3]=java.lang.Object(LinkedList(40, x1[8])) ⇒ 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (331) using rules (III), (IV) which results in the following new constraint:
(332)    (8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(40, x1[8])))≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(40, x1[8])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(40, x1[8])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (332) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(333)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (333) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(334)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (334) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(335)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (335) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(336)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_62] ≥ 0)
We consider the chain 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]), 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9]))) → 6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9]) which results in the following constraint:
(337)    (java.lang.Object(LinkedList(43, x1[3]))=java.lang.Object(LinkedList(x2[9], x3[9]))∧x2[3]=x4[9]∧x3[3]=java.lang.Object(LinkedList(41, x1[9])) ⇒ 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (337) using rules (I), (II), (III), (IV) which results in the following new constraint:
(338)    (8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(41, x1[9])))≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(41, x1[9])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(41, x1[9])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (338) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(339)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (339) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(340)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (340) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(341)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (341) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(342)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_62] ≥ 0)
We consider the chain 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]), 6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10]) which results in the following constraint:
(343)    (java.lang.Object(LinkedList(43, x1[3]))=x2[10]∧x2[3]=x3[10]∧x3[3]=java.lang.Object(LinkedList(42, x1[10])) ⇒ 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (343) using rules (III), (IV) which results in the following new constraint:
(344)    (8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(42, x1[10])))≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(42, x1[10])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(42, x1[10])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (344) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(345)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (345) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(346)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (346) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(347)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (347) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(348)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_62] ≥ 0)
We consider the chain 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]), 6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11]) which results in the following constraint:
(349)    (java.lang.Object(LinkedList(43, x1[3]))=x2[11]∧x2[3]=x3[11]∧x3[3]=java.lang.Object(LinkedList(43, x1[11])) ⇒ 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (349) using rules (III), (IV) which results in the following new constraint:
(350)    (8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(43, x1[11])))≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(43, x1[11])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(43, x1[11])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (350) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(351)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (351) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(352)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (352) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(353)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (353) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(354)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_62] ≥ 0)
We consider the chain 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]), 6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12]))) → 6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12]) which results in the following constraint:
(355)    (java.lang.Object(LinkedList(43, x1[3]))=x2[12]∧x2[3]=x3[12]∧x3[3]=java.lang.Object(LinkedList(44, x1[12])) ⇒ 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (355) using rules (III), (IV) which results in the following new constraint:
(356)    (8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(44, x1[12])))≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(44, x1[12])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(44, x1[12])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (356) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(357)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (357) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(358)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (358) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(359)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (359) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(360)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_62] ≥ 0)
We consider the chain 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]), 6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13]) which results in the following constraint:
(361)    (java.lang.Object(LinkedList(43, x1[3]))=x2[13]∧x2[3]=x3[13]∧x3[3]=java.lang.Object(LinkedList(45, x1[13])) ⇒ 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (361) using rules (III), (IV) which results in the following new constraint:
(362)    (8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(45, x1[13])))≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(45, x1[13])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(45, x1[13])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (362) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(363)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (363) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(364)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (364) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(365)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (365) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(366)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_62] ≥ 0)
We consider the chain 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]), 6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14]))) → 6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14]) which results in the following constraint:
(367)    (java.lang.Object(LinkedList(43, x1[3]))=x2[14]∧x2[3]=x3[14]∧x3[3]=java.lang.Object(LinkedList(46, x1[14])) ⇒ 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (367) using rules (III), (IV) which results in the following new constraint:
(368)    (8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(46, x1[14])))≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(46, x1[14])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(46, x1[14])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (368) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(369)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (369) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(370)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (370) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(371)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (371) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(372)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_62] ≥ 0)
We consider the chain 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]), 6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15]) which results in the following constraint:
(373)    (java.lang.Object(LinkedList(43, x1[3]))=x2[15]∧x2[3]=x3[15]∧x3[3]=java.lang.Object(LinkedList(47, x1[15])) ⇒ 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (373) using rules (III), (IV) which results in the following new constraint:
(374)    (8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(47, x1[15])))≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(47, x1[15])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(47, x1[15])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (374) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(375)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (375) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(376)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (376) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(377)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (377) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(378)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_62] ≥ 0)
We consider the chain 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]), 6432_0_TOPOSTFIX_NULL(x2[16], x3[16], java.lang.Object(LinkedList(x0[16], x1[16]))) → COND_6432_0_TOPOSTFIX_NULL(>(x0[16], 47), x2[16], x3[16], java.lang.Object(LinkedList(x0[16], x1[16]))) which results in the following constraint:
(379)    (java.lang.Object(LinkedList(43, x1[3]))=x2[16]∧x2[3]=x3[16]∧x3[3]=java.lang.Object(LinkedList(x0[16], x1[16])) ⇒ 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (379) using rules (III), (IV) which results in the following new constraint:
(380)    (8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(x0[16], x1[16])))≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(x0[16], x1[16])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(x0[16], x1[16])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (380) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(381)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (381) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(382)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (382) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(383)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (383) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(384)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_62] ≥ 0)
We consider the chain 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]), 6432_0_TOPOSTFIX_NULL(x2[19], x3[19], java.lang.Object(LinkedList(44, x1[19]))) → 6715_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(44, x1[19])), x2[19], x3[19]) which results in the following constraint:
(385)    (java.lang.Object(LinkedList(43, x1[3]))=x2[19]∧x2[3]=x3[19]∧x3[3]=java.lang.Object(LinkedList(44, x1[19])) ⇒ 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (385) using rules (III), (IV) which results in the following new constraint:
(386)    (8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(44, x1[19])))≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(44, x1[19])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(44, x1[19])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (386) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(387)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (387) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(388)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (388) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(389)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (389) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(390)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_62] ≥ 0)
We consider the chain 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]), 6432_0_TOPOSTFIX_NULL(x2[20], x3[20], java.lang.Object(LinkedList(46, x1[20]))) → 6725_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(46, x1[20])), x2[20], x3[20]) which results in the following constraint:
(391)    (java.lang.Object(LinkedList(43, x1[3]))=x2[20]∧x2[3]=x3[20]∧x3[3]=java.lang.Object(LinkedList(46, x1[20])) ⇒ 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (391) using rules (III), (IV) which results in the following new constraint:
(392)    (8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(46, x1[20])))≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(46, x1[20])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(46, x1[20])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (392) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(393)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (393) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(394)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (394) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(395)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (395) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(396)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_62] ≥ 0)
We consider the chain 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]), 6432_0_TOPOSTFIX_NULL(x2[21], x3[21], java.lang.Object(LinkedList(40, x1[21]))) → 7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21]) which results in the following constraint:
(397)    (java.lang.Object(LinkedList(43, x1[3]))=x2[21]∧x2[3]=x3[21]∧x3[3]=java.lang.Object(LinkedList(40, x1[21])) ⇒ 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (397) using rules (III), (IV) which results in the following new constraint:
(398)    (8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(40, x1[21])))≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(40, x1[21])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(40, x1[21])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (398) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(399)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (399) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(400)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (400) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(401)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (401) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(402)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_62] ≥ 0)
We consider the chain 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]), 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x4[22], java.lang.Object(LinkedList(41, x1[22]))) → 8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22]) which results in the following constraint:
(403)    (java.lang.Object(LinkedList(43, x1[3]))=java.lang.Object(LinkedList(x2[22], x3[22]))∧x2[3]=x4[22]∧x3[3]=java.lang.Object(LinkedList(41, x1[22])) ⇒ 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (403) using rules (I), (II), (III), (IV) which results in the following new constraint:
(404)    (8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(41, x1[22])))≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(41, x1[22])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(41, x1[22])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (404) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(405)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (405) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(406)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (406) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(407)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (407) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(408)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_62] ≥ 0)
We consider the chain 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]), 6432_0_TOPOSTFIX_NULL(x2[23], x3[23], java.lang.Object(LinkedList(42, x1[23]))) → 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23]) which results in the following constraint:
(409)    (java.lang.Object(LinkedList(43, x1[3]))=x2[23]∧x2[3]=x3[23]∧x3[3]=java.lang.Object(LinkedList(42, x1[23])) ⇒ 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (409) using rules (III), (IV) which results in the following new constraint:
(410)    (8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(42, x1[23])))≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(42, x1[23])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(42, x1[23])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (410) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(411)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (411) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(412)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (412) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(413)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (413) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(414)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_62] ≥ 0)
We consider the chain 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]), 6432_0_TOPOSTFIX_NULL(x2[24], x3[24], java.lang.Object(LinkedList(43, x1[24]))) → 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24]) which results in the following constraint:
(415)    (java.lang.Object(LinkedList(43, x1[3]))=x2[24]∧x2[3]=x3[24]∧x3[3]=java.lang.Object(LinkedList(43, x1[24])) ⇒ 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (415) using rules (III), (IV) which results in the following new constraint:
(416)    (8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(43, x1[24])))≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(43, x1[24])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(43, x1[24])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (416) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(417)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (417) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(418)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (418) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(419)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (419) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(420)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_62] ≥ 0)
We consider the chain 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]), 6432_0_TOPOSTFIX_NULL(x2[25], x3[25], java.lang.Object(LinkedList(45, x1[25]))) → 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25]) which results in the following constraint:
(421)    (java.lang.Object(LinkedList(43, x1[3]))=x2[25]∧x2[3]=x3[25]∧x3[3]=java.lang.Object(LinkedList(45, x1[25])) ⇒ 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (421) using rules (III), (IV) which results in the following new constraint:
(422)    (8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(45, x1[25])))≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(45, x1[25])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(45, x1[25])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (422) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(423)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (423) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(424)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (424) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(425)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (425) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(426)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_62] ≥ 0)
We consider the chain 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]), 6432_0_TOPOSTFIX_NULL(x2[26], x3[26], java.lang.Object(LinkedList(47, x1[26]))) → 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26]) which results in the following constraint:
(427)    (java.lang.Object(LinkedList(43, x1[3]))=x2[26]∧x2[3]=x3[26]∧x3[3]=java.lang.Object(LinkedList(47, x1[26])) ⇒ 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (427) using rules (III), (IV) which results in the following new constraint:
(428)    (8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(47, x1[26])))≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(47, x1[26])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(47, x1[26])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (428) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(429)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (429) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(430)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (430) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(431)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (431) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(432)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_62] ≥ 0)

For Pair 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1)), x2, x3) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1)), x2, x3) the following chains were created:

We consider the chain 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]), 6432_0_TOPOSTFIX_NULL(x2[6], x3[6], java.lang.Object(LinkedList(x0[6], x1[6]))) → COND_6432_0_TOPOSTFIX_NULL(<(x0[6], 40), x2[6], x3[6], java.lang.Object(LinkedList(x0[6], x1[6]))) which results in the following constraint:
(433)    (java.lang.Object(LinkedList(45, x1[4]))=x2[6]∧x2[4]=x3[6]∧x3[4]=java.lang.Object(LinkedList(x0[6], x1[6])) ⇒ 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (433) using rules (III), (IV) which results in the following new constraint:
(434)    (8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(x0[6], x1[6])))≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(x0[6], x1[6])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(x0[6], x1[6])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (434) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(435)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (435) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(436)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (436) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(437)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (437) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(438)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_64] ≥ 0)
We consider the chain 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]), 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8]))) → 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8]) which results in the following constraint:
(439)    (java.lang.Object(LinkedList(45, x1[4]))=x2[8]∧x2[4]=x3[8]∧x3[4]=java.lang.Object(LinkedList(40, x1[8])) ⇒ 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (439) using rules (III), (IV) which results in the following new constraint:
(440)    (8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(40, x1[8])))≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(40, x1[8])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(40, x1[8])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (440) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(441)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (441) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(442)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (442) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(443)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (443) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(444)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_64] ≥ 0)
We consider the chain 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]), 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9]))) → 6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9]) which results in the following constraint:
(445)    (java.lang.Object(LinkedList(45, x1[4]))=java.lang.Object(LinkedList(x2[9], x3[9]))∧x2[4]=x4[9]∧x3[4]=java.lang.Object(LinkedList(41, x1[9])) ⇒ 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (445) using rules (I), (II), (III), (IV) which results in the following new constraint:
(446)    (8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(41, x1[9])))≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(41, x1[9])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(41, x1[9])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (446) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(447)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (447) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(448)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (448) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(449)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (449) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(450)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_64] ≥ 0)
We consider the chain 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]), 6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10]) which results in the following constraint:
(451)    (java.lang.Object(LinkedList(45, x1[4]))=x2[10]∧x2[4]=x3[10]∧x3[4]=java.lang.Object(LinkedList(42, x1[10])) ⇒ 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (451) using rules (III), (IV) which results in the following new constraint:
(452)    (8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(42, x1[10])))≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(42, x1[10])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(42, x1[10])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (452) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(453)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (453) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(454)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (454) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(455)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (455) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(456)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_64] ≥ 0)
We consider the chain 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]), 6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11]) which results in the following constraint:
(457)    (java.lang.Object(LinkedList(45, x1[4]))=x2[11]∧x2[4]=x3[11]∧x3[4]=java.lang.Object(LinkedList(43, x1[11])) ⇒ 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (457) using rules (III), (IV) which results in the following new constraint:
(458)    (8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(43, x1[11])))≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(43, x1[11])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(43, x1[11])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (458) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(459)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (459) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(460)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (460) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(461)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (461) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(462)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_64] ≥ 0)
We consider the chain 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]), 6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12]))) → 6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12]) which results in the following constraint:
(463)    (java.lang.Object(LinkedList(45, x1[4]))=x2[12]∧x2[4]=x3[12]∧x3[4]=java.lang.Object(LinkedList(44, x1[12])) ⇒ 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (463) using rules (III), (IV) which results in the following new constraint:
(464)    (8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(44, x1[12])))≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(44, x1[12])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(44, x1[12])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (464) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(465)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (465) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(466)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (466) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(467)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (467) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(468)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_64] ≥ 0)
We consider the chain 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]), 6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13]) which results in the following constraint:
(469)    (java.lang.Object(LinkedList(45, x1[4]))=x2[13]∧x2[4]=x3[13]∧x3[4]=java.lang.Object(LinkedList(45, x1[13])) ⇒ 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (469) using rules (III), (IV) which results in the following new constraint:
(470)    (8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(45, x1[13])))≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(45, x1[13])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(45, x1[13])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (470) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(471)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (471) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(472)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (472) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(473)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (473) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(474)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_64] ≥ 0)
We consider the chain 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]), 6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14]))) → 6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14]) which results in the following constraint:
(475)    (java.lang.Object(LinkedList(45, x1[4]))=x2[14]∧x2[4]=x3[14]∧x3[4]=java.lang.Object(LinkedList(46, x1[14])) ⇒ 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (475) using rules (III), (IV) which results in the following new constraint:
(476)    (8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(46, x1[14])))≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(46, x1[14])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(46, x1[14])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (476) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(477)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (477) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(478)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (478) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(479)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (479) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(480)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_64] ≥ 0)
We consider the chain 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]), 6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15]) which results in the following constraint:
(481)    (java.lang.Object(LinkedList(45, x1[4]))=x2[15]∧x2[4]=x3[15]∧x3[4]=java.lang.Object(LinkedList(47, x1[15])) ⇒ 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (481) using rules (III), (IV) which results in the following new constraint:
(482)    (8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(47, x1[15])))≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(47, x1[15])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(47, x1[15])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (482) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(483)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (483) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(484)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (484) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(485)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (485) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(486)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_64] ≥ 0)
We consider the chain 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]), 6432_0_TOPOSTFIX_NULL(x2[16], x3[16], java.lang.Object(LinkedList(x0[16], x1[16]))) → COND_6432_0_TOPOSTFIX_NULL(>(x0[16], 47), x2[16], x3[16], java.lang.Object(LinkedList(x0[16], x1[16]))) which results in the following constraint:
(487)    (java.lang.Object(LinkedList(45, x1[4]))=x2[16]∧x2[4]=x3[16]∧x3[4]=java.lang.Object(LinkedList(x0[16], x1[16])) ⇒ 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (487) using rules (III), (IV) which results in the following new constraint:
(488)    (8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(x0[16], x1[16])))≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(x0[16], x1[16])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(x0[16], x1[16])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (488) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(489)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (489) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(490)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (490) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(491)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (491) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(492)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_64] ≥ 0)
We consider the chain 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]), 6432_0_TOPOSTFIX_NULL(x2[19], x3[19], java.lang.Object(LinkedList(44, x1[19]))) → 6715_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(44, x1[19])), x2[19], x3[19]) which results in the following constraint:
(493)    (java.lang.Object(LinkedList(45, x1[4]))=x2[19]∧x2[4]=x3[19]∧x3[4]=java.lang.Object(LinkedList(44, x1[19])) ⇒ 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (493) using rules (III), (IV) which results in the following new constraint:
(494)    (8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(44, x1[19])))≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(44, x1[19])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(44, x1[19])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (494) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(495)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (495) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(496)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (496) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(497)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (497) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(498)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_64] ≥ 0)
We consider the chain 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]), 6432_0_TOPOSTFIX_NULL(x2[20], x3[20], java.lang.Object(LinkedList(46, x1[20]))) → 6725_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(46, x1[20])), x2[20], x3[20]) which results in the following constraint:
(499)    (java.lang.Object(LinkedList(45, x1[4]))=x2[20]∧x2[4]=x3[20]∧x3[4]=java.lang.Object(LinkedList(46, x1[20])) ⇒ 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (499) using rules (III), (IV) which results in the following new constraint:
(500)    (8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(46, x1[20])))≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(46, x1[20])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(46, x1[20])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (500) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(501)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (501) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(502)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (502) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(503)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (503) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(504)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_64] ≥ 0)
We consider the chain 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]), 6432_0_TOPOSTFIX_NULL(x2[21], x3[21], java.lang.Object(LinkedList(40, x1[21]))) → 7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21]) which results in the following constraint:
(505)    (java.lang.Object(LinkedList(45, x1[4]))=x2[21]∧x2[4]=x3[21]∧x3[4]=java.lang.Object(LinkedList(40, x1[21])) ⇒ 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (505) using rules (III), (IV) which results in the following new constraint:
(506)    (8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(40, x1[21])))≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(40, x1[21])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(40, x1[21])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (506) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(507)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (507) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(508)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (508) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(509)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (509) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(510)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_64] ≥ 0)
We consider the chain 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]), 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x4[22], java.lang.Object(LinkedList(41, x1[22]))) → 8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22]) which results in the following constraint:
(511)    (java.lang.Object(LinkedList(45, x1[4]))=java.lang.Object(LinkedList(x2[22], x3[22]))∧x2[4]=x4[22]∧x3[4]=java.lang.Object(LinkedList(41, x1[22])) ⇒ 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (511) using rules (I), (II), (III), (IV) which results in the following new constraint:
(512)    (8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(41, x1[22])))≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(41, x1[22])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(41, x1[22])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (512) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(513)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (513) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(514)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (514) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(515)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (515) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(516)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_64] ≥ 0)
We consider the chain 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]), 6432_0_TOPOSTFIX_NULL(x2[23], x3[23], java.lang.Object(LinkedList(42, x1[23]))) → 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23]) which results in the following constraint:
(517)    (java.lang.Object(LinkedList(45, x1[4]))=x2[23]∧x2[4]=x3[23]∧x3[4]=java.lang.Object(LinkedList(42, x1[23])) ⇒ 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (517) using rules (III), (IV) which results in the following new constraint:
(518)    (8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(42, x1[23])))≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(42, x1[23])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(42, x1[23])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (518) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(519)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (519) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(520)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (520) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(521)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (521) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(522)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_64] ≥ 0)
We consider the chain 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]), 6432_0_TOPOSTFIX_NULL(x2[24], x3[24], java.lang.Object(LinkedList(43, x1[24]))) → 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24]) which results in the following constraint:
(523)    (java.lang.Object(LinkedList(45, x1[4]))=x2[24]∧x2[4]=x3[24]∧x3[4]=java.lang.Object(LinkedList(43, x1[24])) ⇒ 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (523) using rules (III), (IV) which results in the following new constraint:
(524)    (8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(43, x1[24])))≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(43, x1[24])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(43, x1[24])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (524) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(525)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (525) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(526)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (526) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(527)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (527) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(528)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_64] ≥ 0)
We consider the chain 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]), 6432_0_TOPOSTFIX_NULL(x2[25], x3[25], java.lang.Object(LinkedList(45, x1[25]))) → 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25]) which results in the following constraint:
(529)    (java.lang.Object(LinkedList(45, x1[4]))=x2[25]∧x2[4]=x3[25]∧x3[4]=java.lang.Object(LinkedList(45, x1[25])) ⇒ 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (529) using rules (III), (IV) which results in the following new constraint:
(530)    (8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(45, x1[25])))≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(45, x1[25])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(45, x1[25])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (530) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(531)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (531) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(532)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (532) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(533)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (533) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(534)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_64] ≥ 0)
We consider the chain 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]), 6432_0_TOPOSTFIX_NULL(x2[26], x3[26], java.lang.Object(LinkedList(47, x1[26]))) → 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26]) which results in the following constraint:
(535)    (java.lang.Object(LinkedList(45, x1[4]))=x2[26]∧x2[4]=x3[26]∧x3[4]=java.lang.Object(LinkedList(47, x1[26])) ⇒ 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (535) using rules (III), (IV) which results in the following new constraint:
(536)    (8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(47, x1[26])))≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(47, x1[26])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(47, x1[26])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (536) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(537)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (537) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(538)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (538) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(539)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (539) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(540)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_64] ≥ 0)

For Pair 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1)), x2, x3) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1)), x2, x3) the following chains were created:

We consider the chain 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]), 6432_0_TOPOSTFIX_NULL(x2[6], x3[6], java.lang.Object(LinkedList(x0[6], x1[6]))) → COND_6432_0_TOPOSTFIX_NULL(<(x0[6], 40), x2[6], x3[6], java.lang.Object(LinkedList(x0[6], x1[6]))) which results in the following constraint:
(541)    (java.lang.Object(LinkedList(47, x1[5]))=x2[6]∧x2[5]=x3[6]∧x3[5]=java.lang.Object(LinkedList(x0[6], x1[6])) ⇒ 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (541) using rules (III), (IV) which results in the following new constraint:
(542)    (8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(x0[6], x1[6])))≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(x0[6], x1[6])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(x0[6], x1[6])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (542) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(543)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (543) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(544)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (544) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(545)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (545) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(546)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_66] ≥ 0)
We consider the chain 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]), 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8]))) → 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8]) which results in the following constraint:
(547)    (java.lang.Object(LinkedList(47, x1[5]))=x2[8]∧x2[5]=x3[8]∧x3[5]=java.lang.Object(LinkedList(40, x1[8])) ⇒ 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (547) using rules (III), (IV) which results in the following new constraint:
(548)    (8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(40, x1[8])))≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(40, x1[8])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(40, x1[8])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (548) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(549)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (549) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(550)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (550) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(551)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (551) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(552)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_66] ≥ 0)
We consider the chain 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]), 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9]))) → 6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9]) which results in the following constraint:
(553)    (java.lang.Object(LinkedList(47, x1[5]))=java.lang.Object(LinkedList(x2[9], x3[9]))∧x2[5]=x4[9]∧x3[5]=java.lang.Object(LinkedList(41, x1[9])) ⇒ 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (553) using rules (I), (II), (III), (IV) which results in the following new constraint:
(554)    (8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(41, x1[9])))≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(41, x1[9])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(41, x1[9])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (554) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(555)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (555) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(556)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (556) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(557)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (557) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(558)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_66] ≥ 0)
We consider the chain 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]), 6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10]) which results in the following constraint:
(559)    (java.lang.Object(LinkedList(47, x1[5]))=x2[10]∧x2[5]=x3[10]∧x3[5]=java.lang.Object(LinkedList(42, x1[10])) ⇒ 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (559) using rules (III), (IV) which results in the following new constraint:
(560)    (8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(42, x1[10])))≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(42, x1[10])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(42, x1[10])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (560) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(561)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (561) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(562)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (562) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(563)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (563) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(564)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_66] ≥ 0)
We consider the chain 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]), 6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11]) which results in the following constraint:
(565)    (java.lang.Object(LinkedList(47, x1[5]))=x2[11]∧x2[5]=x3[11]∧x3[5]=java.lang.Object(LinkedList(43, x1[11])) ⇒ 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (565) using rules (III), (IV) which results in the following new constraint:
(566)    (8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(43, x1[11])))≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(43, x1[11])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(43, x1[11])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (566) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(567)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (567) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(568)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (568) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(569)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (569) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(570)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_66] ≥ 0)
We consider the chain 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]), 6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12]))) → 6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12]) which results in the following constraint:
(571)    (java.lang.Object(LinkedList(47, x1[5]))=x2[12]∧x2[5]=x3[12]∧x3[5]=java.lang.Object(LinkedList(44, x1[12])) ⇒ 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (571) using rules (III), (IV) which results in the following new constraint:
(572)    (8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(44, x1[12])))≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(44, x1[12])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(44, x1[12])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (572) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(573)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (573) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(574)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (574) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(575)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (575) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(576)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_66] ≥ 0)
We consider the chain 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]), 6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13]) which results in the following constraint:
(577)    (java.lang.Object(LinkedList(47, x1[5]))=x2[13]∧x2[5]=x3[13]∧x3[5]=java.lang.Object(LinkedList(45, x1[13])) ⇒ 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (577) using rules (III), (IV) which results in the following new constraint:
(578)    (8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(45, x1[13])))≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(45, x1[13])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(45, x1[13])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (578) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(579)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (579) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(580)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (580) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(581)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (581) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(582)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_66] ≥ 0)
We consider the chain 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]), 6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14]))) → 6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14]) which results in the following constraint:
(583)    (java.lang.Object(LinkedList(47, x1[5]))=x2[14]∧x2[5]=x3[14]∧x3[5]=java.lang.Object(LinkedList(46, x1[14])) ⇒ 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (583) using rules (III), (IV) which results in the following new constraint:
(584)    (8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(46, x1[14])))≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(46, x1[14])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(46, x1[14])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (584) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(585)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (585) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(586)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (586) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(587)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (587) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(588)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_66] ≥ 0)
We consider the chain 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]), 6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15]) which results in the following constraint:
(589)    (java.lang.Object(LinkedList(47, x1[5]))=x2[15]∧x2[5]=x3[15]∧x3[5]=java.lang.Object(LinkedList(47, x1[15])) ⇒ 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (589) using rules (III), (IV) which results in the following new constraint:
(590)    (8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(47, x1[15])))≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(47, x1[15])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(47, x1[15])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (590) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(591)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (591) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(592)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (592) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(593)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (593) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(594)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_66] ≥ 0)
We consider the chain 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]), 6432_0_TOPOSTFIX_NULL(x2[16], x3[16], java.lang.Object(LinkedList(x0[16], x1[16]))) → COND_6432_0_TOPOSTFIX_NULL(>(x0[16], 47), x2[16], x3[16], java.lang.Object(LinkedList(x0[16], x1[16]))) which results in the following constraint:
(595)    (java.lang.Object(LinkedList(47, x1[5]))=x2[16]∧x2[5]=x3[16]∧x3[5]=java.lang.Object(LinkedList(x0[16], x1[16])) ⇒ 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (595) using rules (III), (IV) which results in the following new constraint:
(596)    (8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(x0[16], x1[16])))≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(x0[16], x1[16])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(x0[16], x1[16])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (596) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(597)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (597) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(598)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (598) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(599)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (599) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(600)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_66] ≥ 0)
We consider the chain 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]), 6432_0_TOPOSTFIX_NULL(x2[19], x3[19], java.lang.Object(LinkedList(44, x1[19]))) → 6715_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(44, x1[19])), x2[19], x3[19]) which results in the following constraint:
(601)    (java.lang.Object(LinkedList(47, x1[5]))=x2[19]∧x2[5]=x3[19]∧x3[5]=java.lang.Object(LinkedList(44, x1[19])) ⇒ 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (601) using rules (III), (IV) which results in the following new constraint:
(602)    (8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(44, x1[19])))≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(44, x1[19])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(44, x1[19])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (602) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(603)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (603) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(604)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (604) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(605)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (605) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(606)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_66] ≥ 0)
We consider the chain 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]), 6432_0_TOPOSTFIX_NULL(x2[20], x3[20], java.lang.Object(LinkedList(46, x1[20]))) → 6725_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(46, x1[20])), x2[20], x3[20]) which results in the following constraint:
(607)    (java.lang.Object(LinkedList(47, x1[5]))=x2[20]∧x2[5]=x3[20]∧x3[5]=java.lang.Object(LinkedList(46, x1[20])) ⇒ 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (607) using rules (III), (IV) which results in the following new constraint:
(608)    (8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(46, x1[20])))≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(46, x1[20])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(46, x1[20])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (608) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(609)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (609) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(610)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (610) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(611)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (611) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(612)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_66] ≥ 0)
We consider the chain 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]), 6432_0_TOPOSTFIX_NULL(x2[21], x3[21], java.lang.Object(LinkedList(40, x1[21]))) → 7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21]) which results in the following constraint:
(613)    (java.lang.Object(LinkedList(47, x1[5]))=x2[21]∧x2[5]=x3[21]∧x3[5]=java.lang.Object(LinkedList(40, x1[21])) ⇒ 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (613) using rules (III), (IV) which results in the following new constraint:
(614)    (8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(40, x1[21])))≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(40, x1[21])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(40, x1[21])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (614) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(615)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (615) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(616)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (616) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(617)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (617) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(618)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_66] ≥ 0)
We consider the chain 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]), 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x4[22], java.lang.Object(LinkedList(41, x1[22]))) → 8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22]) which results in the following constraint:
(619)    (java.lang.Object(LinkedList(47, x1[5]))=java.lang.Object(LinkedList(x2[22], x3[22]))∧x2[5]=x4[22]∧x3[5]=java.lang.Object(LinkedList(41, x1[22])) ⇒ 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (619) using rules (I), (II), (III), (IV) which results in the following new constraint:
(620)    (8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(41, x1[22])))≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(41, x1[22])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(41, x1[22])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (620) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(621)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (621) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(622)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (622) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(623)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (623) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(624)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_66] ≥ 0)
We consider the chain 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]), 6432_0_TOPOSTFIX_NULL(x2[23], x3[23], java.lang.Object(LinkedList(42, x1[23]))) → 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23]) which results in the following constraint:
(625)    (java.lang.Object(LinkedList(47, x1[5]))=x2[23]∧x2[5]=x3[23]∧x3[5]=java.lang.Object(LinkedList(42, x1[23])) ⇒ 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (625) using rules (III), (IV) which results in the following new constraint:
(626)    (8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(42, x1[23])))≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(42, x1[23])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(42, x1[23])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (626) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(627)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (627) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(628)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (628) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(629)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (629) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(630)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_66] ≥ 0)
We consider the chain 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]), 6432_0_TOPOSTFIX_NULL(x2[24], x3[24], java.lang.Object(LinkedList(43, x1[24]))) → 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24]) which results in the following constraint:
(631)    (java.lang.Object(LinkedList(47, x1[5]))=x2[24]∧x2[5]=x3[24]∧x3[5]=java.lang.Object(LinkedList(43, x1[24])) ⇒ 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (631) using rules (III), (IV) which results in the following new constraint:
(632)    (8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(43, x1[24])))≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(43, x1[24])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(43, x1[24])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (632) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(633)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (633) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(634)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (634) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(635)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (635) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(636)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_66] ≥ 0)
We consider the chain 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]), 6432_0_TOPOSTFIX_NULL(x2[25], x3[25], java.lang.Object(LinkedList(45, x1[25]))) → 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25]) which results in the following constraint:
(637)    (java.lang.Object(LinkedList(47, x1[5]))=x2[25]∧x2[5]=x3[25]∧x3[5]=java.lang.Object(LinkedList(45, x1[25])) ⇒ 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (637) using rules (III), (IV) which results in the following new constraint:
(638)    (8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(45, x1[25])))≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(45, x1[25])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(45, x1[25])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (638) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(639)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (639) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(640)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (640) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(641)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (641) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(642)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_66] ≥ 0)
We consider the chain 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]), 6432_0_TOPOSTFIX_NULL(x2[26], x3[26], java.lang.Object(LinkedList(47, x1[26]))) → 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26]) which results in the following constraint:
(643)    (java.lang.Object(LinkedList(47, x1[5]))=x2[26]∧x2[5]=x3[26]∧x3[5]=java.lang.Object(LinkedList(47, x1[26])) ⇒ 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (643) using rules (III), (IV) which results in the following new constraint:
(644)    (8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(47, x1[26])))≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(47, x1[26])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(47, x1[26])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (644) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(645)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (645) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(646)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (646) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(647)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (647) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(648)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_66] ≥ 0)

For Pair 6432_0_TOPOSTFIX_NULL(x2, x3, java.lang.Object(LinkedList(x0, x1))) → COND_6432_0_TOPOSTFIX_NULL(<(x0, 40), x2, x3, java.lang.Object(LinkedList(x0, x1))) the following chains were created:

We consider the chain 6432_0_TOPOSTFIX_NULL(x2[6], x3[6], java.lang.Object(LinkedList(x0[6], x1[6]))) → COND_6432_0_TOPOSTFIX_NULL(<(x0[6], 40), x2[6], x3[6], java.lang.Object(LinkedList(x0[6], x1[6]))), COND_6432_0_TOPOSTFIX_NULL(TRUE, x2[7], x3[7], java.lang.Object(LinkedList(x0[7], x1[7]))) → 6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), x1[7]) which results in the following constraint:
(649)    (<(x0[6], 40)=TRUE∧x2[6]=x2[7]∧x3[6]=x3[7]∧java.lang.Object(LinkedList(x0[6], x1[6]))=java.lang.Object(LinkedList(x0[7], x1[7])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[6], x3[6], java.lang.Object(LinkedList(x0[6], x1[6])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[6], x3[6], java.lang.Object(LinkedList(x0[6], x1[6])))≥COND_6432_0_TOPOSTFIX_NULL(<(x0[6], 40), x2[6], x3[6], java.lang.Object(LinkedList(x0[6], x1[6])))∧(U^Increasing(COND_6432_0_TOPOSTFIX_NULL(<(x0[6], 40), x2[6], x3[6], java.lang.Object(LinkedList(x0[6], x1[6])))), ≥))

We simplified constraint (649) using rules (I), (II), (IV) which results in the following new constraint:
(650)    (<(x0[6], 40)=TRUE ⇒ 6432_0_TOPOSTFIX_NULL(x2[6], x3[6], java.lang.Object(LinkedList(x0[6], x1[6])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[6], x3[6], java.lang.Object(LinkedList(x0[6], x1[6])))≥COND_6432_0_TOPOSTFIX_NULL(<(x0[6], 40), x2[6], x3[6], java.lang.Object(LinkedList(x0[6], x1[6])))∧(U^Increasing(COND_6432_0_TOPOSTFIX_NULL(<(x0[6], 40), x2[6], x3[6], java.lang.Object(LinkedList(x0[6], x1[6])))), ≥))

We simplified constraint (650) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(651)    (0 ≥ 0 ⇒ (U^Increasing(COND_6432_0_TOPOSTFIX_NULL(<(x0[6], 40), x2[6], x3[6], java.lang.Object(LinkedList(x0[6], x1[6])))), ≥)∧[bni_67 + (-1)Bound*bni_67] + [(4)bni_67]x1[6] + [(6)bni_67]x0[6] ≥ 0∧[(-1)bso_68] ≥ 0)

We simplified constraint (651) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(652)    (0 ≥ 0 ⇒ (U^Increasing(COND_6432_0_TOPOSTFIX_NULL(<(x0[6], 40), x2[6], x3[6], java.lang.Object(LinkedList(x0[6], x1[6])))), ≥)∧[bni_67 + (-1)Bound*bni_67] + [(4)bni_67]x1[6] + [(6)bni_67]x0[6] ≥ 0∧[(-1)bso_68] ≥ 0)

We simplified constraint (652) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(653)    (0 ≥ 0 ⇒ (U^Increasing(COND_6432_0_TOPOSTFIX_NULL(<(x0[6], 40), x2[6], x3[6], java.lang.Object(LinkedList(x0[6], x1[6])))), ≥)∧[bni_67 + (-1)Bound*bni_67] + [(4)bni_67]x1[6] + [(6)bni_67]x0[6] ≥ 0∧[(-1)bso_68] ≥ 0)

We simplified constraint (653) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(654)    (0 ≥ 0 ⇒ (U^Increasing(COND_6432_0_TOPOSTFIX_NULL(<(x0[6], 40), x2[6], x3[6], java.lang.Object(LinkedList(x0[6], x1[6])))), ≥)∧[(4)bni_67] ≥ 0∧[(6)bni_67] ≥ 0∧0 ≥ 0∧0 ≥ 0∧[bni_67 + (-1)Bound*bni_67] ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_68] ≥ 0)

For Pair COND_6432_0_TOPOSTFIX_NULL(TRUE, x2, x3, java.lang.Object(LinkedList(x0, x1))) → 6432_0_TOPOSTFIX_NULL(x2, java.lang.Object(LinkedList(x0, x3)), x1) the following chains were created:

We consider the chain 6432_0_TOPOSTFIX_NULL(x2[6], x3[6], java.lang.Object(LinkedList(x0[6], x1[6]))) → COND_6432_0_TOPOSTFIX_NULL(<(x0[6], 40), x2[6], x3[6], java.lang.Object(LinkedList(x0[6], x1[6]))), COND_6432_0_TOPOSTFIX_NULL(TRUE, x2[7], x3[7], java.lang.Object(LinkedList(x0[7], x1[7]))) → 6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), x1[7]) which results in the following constraint:
(655)    (<(x0[6], 40)=TRUE∧x2[6]=x2[7]∧x3[6]=x3[7]∧java.lang.Object(LinkedList(x0[6], x1[6]))=java.lang.Object(LinkedList(x0[7], x1[7])) ⇒ COND_6432_0_TOPOSTFIX_NULL(TRUE, x2[7], x3[7], java.lang.Object(LinkedList(x0[7], x1[7])))≥NonInfC∧COND_6432_0_TOPOSTFIX_NULL(TRUE, x2[7], x3[7], java.lang.Object(LinkedList(x0[7], x1[7])))≥6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), x1[7])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), x1[7])), ≥))

We simplified constraint (655) using rules (I), (II), (III) which results in the following new constraint:
(656)    (<(x0[6], 40)=TRUE ⇒ COND_6432_0_TOPOSTFIX_NULL(TRUE, x2[6], x3[6], java.lang.Object(LinkedList(x0[6], x1[6])))≥NonInfC∧COND_6432_0_TOPOSTFIX_NULL(TRUE, x2[6], x3[6], java.lang.Object(LinkedList(x0[6], x1[6])))≥6432_0_TOPOSTFIX_NULL(x2[6], java.lang.Object(LinkedList(x0[6], x3[6])), x1[6])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), x1[7])), ≥))

We simplified constraint (656) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(657)    (0 ≥ 0 ⇒ (U^Increasing(6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), x1[7])), ≥)∧[bni_69 + (-1)Bound*bni_69] + [(4)bni_69]x1[6] + [(6)bni_69]x0[6] ≥ 0∧[2 + (-1)bso_70] + [3]x1[6] + [6]x0[6] ≥ 0)

We simplified constraint (657) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(658)    (0 ≥ 0 ⇒ (U^Increasing(6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), x1[7])), ≥)∧[bni_69 + (-1)Bound*bni_69] + [(4)bni_69]x1[6] + [(6)bni_69]x0[6] ≥ 0∧[2 + (-1)bso_70] + [3]x1[6] + [6]x0[6] ≥ 0)

We simplified constraint (658) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(659)    (0 ≥ 0 ⇒ (U^Increasing(6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), x1[7])), ≥)∧[bni_69 + (-1)Bound*bni_69] + [(4)bni_69]x1[6] + [(6)bni_69]x0[6] ≥ 0∧[2 + (-1)bso_70] + [3]x1[6] + [6]x0[6] ≥ 0)

We simplified constraint (659) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(660)    (0 ≥ 0 ⇒ (U^Increasing(6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), x1[7])), ≥)∧[(4)bni_69] ≥ 0∧[(6)bni_69] ≥ 0∧0 ≥ 0∧0 ≥ 0∧[bni_69 + (-1)Bound*bni_69] ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_70] ≥ 0∧[1] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[16], x3[16], java.lang.Object(LinkedList(x0[16], x1[16]))) → COND_6432_0_TOPOSTFIX_NULL(>(x0[16], 47), x2[16], x3[16], java.lang.Object(LinkedList(x0[16], x1[16]))), COND_6432_0_TOPOSTFIX_NULL(TRUE, x2[7], x3[7], java.lang.Object(LinkedList(x0[7], x1[7]))) → 6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), x1[7]) which results in the following constraint:
(661)    (>(x0[16], 47)=TRUE∧x2[16]=x2[7]∧x3[16]=x3[7]∧java.lang.Object(LinkedList(x0[16], x1[16]))=java.lang.Object(LinkedList(x0[7], x1[7])) ⇒ COND_6432_0_TOPOSTFIX_NULL(TRUE, x2[7], x3[7], java.lang.Object(LinkedList(x0[7], x1[7])))≥NonInfC∧COND_6432_0_TOPOSTFIX_NULL(TRUE, x2[7], x3[7], java.lang.Object(LinkedList(x0[7], x1[7])))≥6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), x1[7])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), x1[7])), ≥))

We simplified constraint (661) using rules (I), (II), (III) which results in the following new constraint:
(662)    (>(x0[16], 47)=TRUE ⇒ COND_6432_0_TOPOSTFIX_NULL(TRUE, x2[16], x3[16], java.lang.Object(LinkedList(x0[16], x1[16])))≥NonInfC∧COND_6432_0_TOPOSTFIX_NULL(TRUE, x2[16], x3[16], java.lang.Object(LinkedList(x0[16], x1[16])))≥6432_0_TOPOSTFIX_NULL(x2[16], java.lang.Object(LinkedList(x0[16], x3[16])), x1[16])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), x1[7])), ≥))

We simplified constraint (662) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(663)    (0 ≥ 0 ⇒ (U^Increasing(6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), x1[7])), ≥)∧[bni_69 + (-1)Bound*bni_69] + [(4)bni_69]x1[16] + [(6)bni_69]x0[16] ≥ 0∧[2 + (-1)bso_70] + [3]x1[16] + [6]x0[16] ≥ 0)

We simplified constraint (663) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(664)    (0 ≥ 0 ⇒ (U^Increasing(6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), x1[7])), ≥)∧[bni_69 + (-1)Bound*bni_69] + [(4)bni_69]x1[16] + [(6)bni_69]x0[16] ≥ 0∧[2 + (-1)bso_70] + [3]x1[16] + [6]x0[16] ≥ 0)

We simplified constraint (664) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(665)    (0 ≥ 0 ⇒ (U^Increasing(6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), x1[7])), ≥)∧[bni_69 + (-1)Bound*bni_69] + [(4)bni_69]x1[16] + [(6)bni_69]x0[16] ≥ 0∧[2 + (-1)bso_70] + [3]x1[16] + [6]x0[16] ≥ 0)

We simplified constraint (665) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(666)    (0 ≥ 0 ⇒ (U^Increasing(6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), x1[7])), ≥)∧[(4)bni_69] ≥ 0∧[(6)bni_69] ≥ 0∧0 ≥ 0∧0 ≥ 0∧[bni_69 + (-1)Bound*bni_69] ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_70] ≥ 0∧[1] ≥ 0∧[1] ≥ 0)

For Pair 6432_0_TOPOSTFIX_NULL(x2, x3, java.lang.Object(LinkedList(40, x1))) → 6432_0_TOPOSTFIX_NULL(x2, x3, x1) the following chains were created:

We consider the chain 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0]) → 6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0]), 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8]))) → 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8]) which results in the following constraint:
(667)    (x0[0]=x2[8]∧x1[0]=x3[8]∧x2[0]=java.lang.Object(LinkedList(40, x1[8])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8])))≥6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥))

We simplified constraint (667) using rule (III) which results in the following new constraint:
(668)    (6432_0_TOPOSTFIX_NULL(x0[0], x1[0], java.lang.Object(LinkedList(40, x1[8])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x0[0], x1[0], java.lang.Object(LinkedList(40, x1[8])))≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x1[8])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥))

We simplified constraint (668) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(669)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (669) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(670)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (670) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(671)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (671) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(672)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧0 ≥ 0∧0 ≥ 0∧[242 + (-1)bso_72] ≥ 0∧[1] ≥ 0)
We consider the chain 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]) → 6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]), 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8]))) → 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8]) which results in the following constraint:
(673)    (x0[1]=x2[8]∧java.lang.Object(LinkedList(x1[1], x2[1]))=x3[8]∧x3[1]=java.lang.Object(LinkedList(40, x1[8])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8])))≥6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥))

We simplified constraint (673) using rule (III) which results in the following new constraint:
(674)    (6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(40, x1[8])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(40, x1[8])))≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x1[8])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥))

We simplified constraint (674) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(675)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (675) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(676)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (676) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(677)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (677) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(678)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[242 + (-1)bso_72] ≥ 0∧[1] ≥ 0)
We consider the chain 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]), 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8]))) → 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8]) which results in the following constraint:
(679)    (java.lang.Object(LinkedList(42, x1[2]))=x2[8]∧x2[2]=x3[8]∧x3[2]=java.lang.Object(LinkedList(40, x1[8])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8])))≥6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥))

We simplified constraint (679) using rule (III) which results in the following new constraint:
(680)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(40, x1[8])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(40, x1[8])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x1[8])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥))

We simplified constraint (680) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(681)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (681) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(682)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (682) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(683)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (683) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(684)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧0 ≥ 0∧0 ≥ 0∧[242 + (-1)bso_72] ≥ 0∧[1] ≥ 0)
We consider the chain 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]), 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8]))) → 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8]) which results in the following constraint:
(685)    (java.lang.Object(LinkedList(43, x1[3]))=x2[8]∧x2[3]=x3[8]∧x3[3]=java.lang.Object(LinkedList(40, x1[8])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8])))≥6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥))

We simplified constraint (685) using rule (III) which results in the following new constraint:
(686)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(40, x1[8])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(40, x1[8])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x1[8])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥))

We simplified constraint (686) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(687)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (687) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(688)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (688) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(689)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (689) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(690)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧0 ≥ 0∧0 ≥ 0∧[242 + (-1)bso_72] ≥ 0∧[1] ≥ 0)
We consider the chain 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]), 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8]))) → 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8]) which results in the following constraint:
(691)    (java.lang.Object(LinkedList(45, x1[4]))=x2[8]∧x2[4]=x3[8]∧x3[4]=java.lang.Object(LinkedList(40, x1[8])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8])))≥6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥))

We simplified constraint (691) using rule (III) which results in the following new constraint:
(692)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(40, x1[8])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(40, x1[8])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x1[8])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥))

We simplified constraint (692) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(693)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (693) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(694)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (694) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(695)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (695) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(696)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧0 ≥ 0∧0 ≥ 0∧[242 + (-1)bso_72] ≥ 0∧[1] ≥ 0)
We consider the chain 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]), 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8]))) → 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8]) which results in the following constraint:
(697)    (java.lang.Object(LinkedList(47, x1[5]))=x2[8]∧x2[5]=x3[8]∧x3[5]=java.lang.Object(LinkedList(40, x1[8])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8])))≥6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥))

We simplified constraint (697) using rule (III) which results in the following new constraint:
(698)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(40, x1[8])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(40, x1[8])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x1[8])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥))

We simplified constraint (698) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(699)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (699) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(700)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (700) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(701)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (701) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(702)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧0 ≥ 0∧0 ≥ 0∧[242 + (-1)bso_72] ≥ 0∧[1] ≥ 0)
We consider the chain COND_6432_0_TOPOSTFIX_NULL(TRUE, x2[7], x3[7], java.lang.Object(LinkedList(x0[7], x1[7]))) → 6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), x1[7]), 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8]))) → 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8]) which results in the following constraint:
(703)    (x2[7]=x2[8]∧java.lang.Object(LinkedList(x0[7], x3[7]))=x3[8]∧x1[7]=java.lang.Object(LinkedList(40, x1[8])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8])))≥6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥))

We simplified constraint (703) using rule (III) which results in the following new constraint:
(704)    (6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), java.lang.Object(LinkedList(40, x1[8])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), java.lang.Object(LinkedList(40, x1[8])))≥6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), x1[8])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥))

We simplified constraint (704) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(705)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (705) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(706)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (706) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(707)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (707) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(708)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[242 + (-1)bso_72] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8]))) → 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8]), 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8]))) → 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8]) which results in the following constraint:
(709)    (x2[8]=x2[8]1∧x3[8]=x3[8]1∧x1[8]=java.lang.Object(LinkedList(40, x1[8]1)) ⇒ 6432_0_TOPOSTFIX_NULL(x2[8]1, x3[8]1, java.lang.Object(LinkedList(40, x1[8]1)))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[8]1, x3[8]1, java.lang.Object(LinkedList(40, x1[8]1)))≥6432_0_TOPOSTFIX_NULL(x2[8]1, x3[8]1, x1[8]1)∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8]1, x3[8]1, x1[8]1)), ≥))

We simplified constraint (709) using rule (III) which results in the following new constraint:
(710)    (6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8]1)))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8]1)))≥6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8]1)∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8]1, x3[8]1, x1[8]1)), ≥))

We simplified constraint (710) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(711)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8]1, x3[8]1, x1[8]1)), ≥)∧[242 + (-1)bso_72] + [3]x1[8]1 ≥ 0)

We simplified constraint (711) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(712)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8]1, x3[8]1, x1[8]1)), ≥)∧[242 + (-1)bso_72] + [3]x1[8]1 ≥ 0)

We simplified constraint (712) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(713)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8]1, x3[8]1, x1[8]1)), ≥)∧[242 + (-1)bso_72] + [3]x1[8]1 ≥ 0)

We simplified constraint (713) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(714)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8]1, x3[8]1, x1[8]1)), ≥)∧0 ≥ 0∧0 ≥ 0∧[242 + (-1)bso_72] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9]))) → 6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9]), 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8]))) → 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8]) which results in the following constraint:
(715)    (x3[9]=x2[8]∧java.lang.Object(LinkedList(x2[9], x4[9]))=x3[8]∧x1[9]=java.lang.Object(LinkedList(40, x1[8])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8])))≥6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥))

We simplified constraint (715) using rule (III) which results in the following new constraint:
(716)    (6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), java.lang.Object(LinkedList(40, x1[8])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), java.lang.Object(LinkedList(40, x1[8])))≥6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[8])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥))

We simplified constraint (716) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(717)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (717) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(718)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (718) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(719)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (719) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(720)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[242 + (-1)bso_72] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10]), 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8]))) → 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8]) which results in the following constraint:
(721)    (java.lang.Object(LinkedList(42, x2[10]))=x2[8]∧x3[10]=x3[8]∧x1[10]=java.lang.Object(LinkedList(40, x1[8])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8])))≥6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥))

We simplified constraint (721) using rule (III) which results in the following new constraint:
(722)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], java.lang.Object(LinkedList(40, x1[8])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], java.lang.Object(LinkedList(40, x1[8])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[8])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥))

We simplified constraint (722) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(723)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (723) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(724)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (724) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(725)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (725) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(726)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧0 ≥ 0∧0 ≥ 0∧[242 + (-1)bso_72] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11]), 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8]))) → 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8]) which results in the following constraint:
(727)    (java.lang.Object(LinkedList(43, x2[11]))=x2[8]∧x3[11]=x3[8]∧x1[11]=java.lang.Object(LinkedList(40, x1[8])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8])))≥6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥))

We simplified constraint (727) using rule (III) which results in the following new constraint:
(728)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], java.lang.Object(LinkedList(40, x1[8])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], java.lang.Object(LinkedList(40, x1[8])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[8])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥))

We simplified constraint (728) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(729)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (729) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(730)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (730) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(731)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (731) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(732)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧0 ≥ 0∧0 ≥ 0∧[242 + (-1)bso_72] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12]))) → 6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12]), 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8]))) → 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8]) which results in the following constraint:
(733)    (x2[12]=x2[8]∧java.lang.Object(LinkedList(44, x3[12]))=x3[8]∧x1[12]=java.lang.Object(LinkedList(40, x1[8])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8])))≥6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥))

We simplified constraint (733) using rule (III) which results in the following new constraint:
(734)    (6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), java.lang.Object(LinkedList(40, x1[8])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), java.lang.Object(LinkedList(40, x1[8])))≥6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[8])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥))

We simplified constraint (734) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(735)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (735) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(736)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (736) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(737)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (737) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(738)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧0 ≥ 0∧0 ≥ 0∧[242 + (-1)bso_72] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13]), 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8]))) → 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8]) which results in the following constraint:
(739)    (java.lang.Object(LinkedList(45, x2[13]))=x2[8]∧x3[13]=x3[8]∧x1[13]=java.lang.Object(LinkedList(40, x1[8])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8])))≥6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥))

We simplified constraint (739) using rule (III) which results in the following new constraint:
(740)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], java.lang.Object(LinkedList(40, x1[8])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], java.lang.Object(LinkedList(40, x1[8])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[8])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥))

We simplified constraint (740) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(741)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (741) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(742)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (742) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(743)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (743) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(744)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧0 ≥ 0∧0 ≥ 0∧[242 + (-1)bso_72] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14]))) → 6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14]), 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8]))) → 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8]) which results in the following constraint:
(745)    (x2[14]=x2[8]∧java.lang.Object(LinkedList(46, x3[14]))=x3[8]∧x1[14]=java.lang.Object(LinkedList(40, x1[8])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8])))≥6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥))

We simplified constraint (745) using rule (III) which results in the following new constraint:
(746)    (6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), java.lang.Object(LinkedList(40, x1[8])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), java.lang.Object(LinkedList(40, x1[8])))≥6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[8])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥))

We simplified constraint (746) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(747)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (747) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(748)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (748) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(749)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (749) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(750)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧0 ≥ 0∧0 ≥ 0∧[242 + (-1)bso_72] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15]), 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8]))) → 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8]) which results in the following constraint:
(751)    (java.lang.Object(LinkedList(47, x2[15]))=x2[8]∧x3[15]=x3[8]∧x1[15]=java.lang.Object(LinkedList(40, x1[8])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8])))≥6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥))

We simplified constraint (751) using rule (III) which results in the following new constraint:
(752)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], java.lang.Object(LinkedList(40, x1[8])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], java.lang.Object(LinkedList(40, x1[8])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[8])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥))

We simplified constraint (752) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(753)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (753) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(754)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (754) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(755)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (755) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(756)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧0 ≥ 0∧0 ≥ 0∧[242 + (-1)bso_72] ≥ 0∧[1] ≥ 0)
We consider the chain 6715_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(44, x1[17])), x2[17], x3[17]) → 6432_0_TOPOSTFIX_NULL(x2[17], java.lang.Object(LinkedList(44, x3[17])), x1[17]), 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8]))) → 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8]) which results in the following constraint:
(757)    (x2[17]=x2[8]∧java.lang.Object(LinkedList(44, x3[17]))=x3[8]∧x1[17]=java.lang.Object(LinkedList(40, x1[8])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8])))≥6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥))

We simplified constraint (757) using rule (III) which results in the following new constraint:
(758)    (6432_0_TOPOSTFIX_NULL(x2[17], java.lang.Object(LinkedList(44, x3[17])), java.lang.Object(LinkedList(40, x1[8])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[17], java.lang.Object(LinkedList(44, x3[17])), java.lang.Object(LinkedList(40, x1[8])))≥6432_0_TOPOSTFIX_NULL(x2[17], java.lang.Object(LinkedList(44, x3[17])), x1[8])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥))

We simplified constraint (758) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(759)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (759) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(760)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (760) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(761)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (761) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(762)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧0 ≥ 0∧0 ≥ 0∧[242 + (-1)bso_72] ≥ 0∧[1] ≥ 0)
We consider the chain 6725_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(46, x1[18])), x2[18], x3[18]) → 6432_0_TOPOSTFIX_NULL(x2[18], java.lang.Object(LinkedList(46, x3[18])), x1[18]), 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8]))) → 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8]) which results in the following constraint:
(763)    (x2[18]=x2[8]∧java.lang.Object(LinkedList(46, x3[18]))=x3[8]∧x1[18]=java.lang.Object(LinkedList(40, x1[8])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8])))≥6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥))

We simplified constraint (763) using rule (III) which results in the following new constraint:
(764)    (6432_0_TOPOSTFIX_NULL(x2[18], java.lang.Object(LinkedList(46, x3[18])), java.lang.Object(LinkedList(40, x1[8])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[18], java.lang.Object(LinkedList(46, x3[18])), java.lang.Object(LinkedList(40, x1[8])))≥6432_0_TOPOSTFIX_NULL(x2[18], java.lang.Object(LinkedList(46, x3[18])), x1[8])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥))

We simplified constraint (764) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(765)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (765) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(766)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (766) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(767)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (767) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(768)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧0 ≥ 0∧0 ≥ 0∧[242 + (-1)bso_72] ≥ 0∧[1] ≥ 0)

For Pair 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2, x3)), x4, java.lang.Object(LinkedList(41, x1))) → 6432_0_TOPOSTFIX_NULL(x3, java.lang.Object(LinkedList(x2, x4)), x1) the following chains were created:

We consider the chain 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0]) → 6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0]), 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9]))) → 6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9]) which results in the following constraint:
(769)    (x0[0]=java.lang.Object(LinkedList(x2[9], x3[9]))∧x1[0]=x4[9]∧x2[0]=java.lang.Object(LinkedList(41, x1[9])) ⇒ 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9])))≥6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥))

We simplified constraint (769) using rule (III) which results in the following new constraint:
(770)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x1[0], java.lang.Object(LinkedList(41, x1[9])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x1[0], java.lang.Object(LinkedList(41, x1[9])))≥6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x1[0])), x1[9])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥))

We simplified constraint (770) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(771)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧[248 + (-1)bso_74] + [3]x1[9] ≥ 0)

We simplified constraint (771) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(772)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧[248 + (-1)bso_74] + [3]x1[9] ≥ 0)

We simplified constraint (772) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(773)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧[248 + (-1)bso_74] + [3]x1[9] ≥ 0)

We simplified constraint (773) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(774)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[248 + (-1)bso_74] ≥ 0∧[1] ≥ 0)
We consider the chain 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]) → 6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]), 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9]))) → 6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9]) which results in the following constraint:
(775)    (x0[1]=java.lang.Object(LinkedList(x2[9], x3[9]))∧java.lang.Object(LinkedList(x1[1], x2[1]))=x4[9]∧x3[1]=java.lang.Object(LinkedList(41, x1[9])) ⇒ 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9])))≥6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥))

We simplified constraint (775) using rule (III) which results in the following new constraint:
(776)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(41, x1[9])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(41, x1[9])))≥6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], java.lang.Object(LinkedList(x1[1], x2[1])))), x1[9])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥))

We simplified constraint (776) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(777)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧[248 + (-1)bso_74] + [3]x1[9] ≥ 0)

We simplified constraint (777) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(778)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧[248 + (-1)bso_74] + [3]x1[9] ≥ 0)

We simplified constraint (778) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(779)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧[248 + (-1)bso_74] + [3]x1[9] ≥ 0)

We simplified constraint (779) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(780)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[248 + (-1)bso_74] ≥ 0∧[1] ≥ 0)
We consider the chain 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]), 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9]))) → 6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9]) which results in the following constraint:
(781)    (java.lang.Object(LinkedList(42, x1[2]))=java.lang.Object(LinkedList(x2[9], x3[9]))∧x2[2]=x4[9]∧x3[2]=java.lang.Object(LinkedList(41, x1[9])) ⇒ 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9])))≥6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥))

We simplified constraint (781) using rules (I), (II), (III) which results in the following new constraint:
(782)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(41, x1[9])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(41, x1[9])))≥6432_0_TOPOSTFIX_NULL(x1[2], java.lang.Object(LinkedList(42, x2[2])), x1[9])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥))

We simplified constraint (782) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(783)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧[248 + (-1)bso_74] + [3]x1[9] ≥ 0)

We simplified constraint (783) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(784)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧[248 + (-1)bso_74] + [3]x1[9] ≥ 0)

We simplified constraint (784) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(785)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧[248 + (-1)bso_74] + [3]x1[9] ≥ 0)

We simplified constraint (785) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(786)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧0 ≥ 0∧0 ≥ 0∧[248 + (-1)bso_74] ≥ 0∧[1] ≥ 0)
We consider the chain 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]), 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9]))) → 6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9]) which results in the following constraint:
(787)    (java.lang.Object(LinkedList(43, x1[3]))=java.lang.Object(LinkedList(x2[9], x3[9]))∧x2[3]=x4[9]∧x3[3]=java.lang.Object(LinkedList(41, x1[9])) ⇒ 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9])))≥6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥))

We simplified constraint (787) using rules (I), (II), (III) which results in the following new constraint:
(788)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(41, x1[9])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(41, x1[9])))≥6432_0_TOPOSTFIX_NULL(x1[3], java.lang.Object(LinkedList(43, x2[3])), x1[9])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥))

We simplified constraint (788) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(789)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧[248 + (-1)bso_74] + [3]x1[9] ≥ 0)

We simplified constraint (789) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(790)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧[248 + (-1)bso_74] + [3]x1[9] ≥ 0)

We simplified constraint (790) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(791)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧[248 + (-1)bso_74] + [3]x1[9] ≥ 0)

We simplified constraint (791) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(792)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧0 ≥ 0∧0 ≥ 0∧[248 + (-1)bso_74] ≥ 0∧[1] ≥ 0)
We consider the chain 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]), 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9]))) → 6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9]) which results in the following constraint:
(793)    (java.lang.Object(LinkedList(45, x1[4]))=java.lang.Object(LinkedList(x2[9], x3[9]))∧x2[4]=x4[9]∧x3[4]=java.lang.Object(LinkedList(41, x1[9])) ⇒ 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9])))≥6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥))

We simplified constraint (793) using rules (I), (II), (III) which results in the following new constraint:
(794)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(41, x1[9])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(41, x1[9])))≥6432_0_TOPOSTFIX_NULL(x1[4], java.lang.Object(LinkedList(45, x2[4])), x1[9])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥))

We simplified constraint (794) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(795)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧[248 + (-1)bso_74] + [3]x1[9] ≥ 0)

We simplified constraint (795) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(796)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧[248 + (-1)bso_74] + [3]x1[9] ≥ 0)

We simplified constraint (796) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(797)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧[248 + (-1)bso_74] + [3]x1[9] ≥ 0)

We simplified constraint (797) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(798)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧0 ≥ 0∧0 ≥ 0∧[248 + (-1)bso_74] ≥ 0∧[1] ≥ 0)
We consider the chain 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]), 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9]))) → 6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9]) which results in the following constraint:
(799)    (java.lang.Object(LinkedList(47, x1[5]))=java.lang.Object(LinkedList(x2[9], x3[9]))∧x2[5]=x4[9]∧x3[5]=java.lang.Object(LinkedList(41, x1[9])) ⇒ 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9])))≥6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥))

We simplified constraint (799) using rules (I), (II), (III) which results in the following new constraint:
(800)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(41, x1[9])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(41, x1[9])))≥6432_0_TOPOSTFIX_NULL(x1[5], java.lang.Object(LinkedList(47, x2[5])), x1[9])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥))

We simplified constraint (800) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(801)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧[248 + (-1)bso_74] + [3]x1[9] ≥ 0)

We simplified constraint (801) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(802)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧[248 + (-1)bso_74] + [3]x1[9] ≥ 0)

We simplified constraint (802) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(803)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧[248 + (-1)bso_74] + [3]x1[9] ≥ 0)

We simplified constraint (803) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(804)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧0 ≥ 0∧0 ≥ 0∧[248 + (-1)bso_74] ≥ 0∧[1] ≥ 0)
We consider the chain COND_6432_0_TOPOSTFIX_NULL(TRUE, x2[7], x3[7], java.lang.Object(LinkedList(x0[7], x1[7]))) → 6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), x1[7]), 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9]))) → 6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9]) which results in the following constraint:
(805)    (x2[7]=java.lang.Object(LinkedList(x2[9], x3[9]))∧java.lang.Object(LinkedList(x0[7], x3[7]))=x4[9]∧x1[7]=java.lang.Object(LinkedList(41, x1[9])) ⇒ 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9])))≥6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥))

We simplified constraint (805) using rule (III) which results in the following new constraint:
(806)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), java.lang.Object(LinkedList(x0[7], x3[7])), java.lang.Object(LinkedList(41, x1[9])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), java.lang.Object(LinkedList(x0[7], x3[7])), java.lang.Object(LinkedList(41, x1[9])))≥6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], java.lang.Object(LinkedList(x0[7], x3[7])))), x1[9])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥))

We simplified constraint (806) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(807)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧[248 + (-1)bso_74] + [3]x1[9] ≥ 0)

We simplified constraint (807) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(808)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧[248 + (-1)bso_74] + [3]x1[9] ≥ 0)

We simplified constraint (808) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(809)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧[248 + (-1)bso_74] + [3]x1[9] ≥ 0)

We simplified constraint (809) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(810)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[248 + (-1)bso_74] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8]))) → 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8]), 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9]))) → 6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9]) which results in the following constraint:
(811)    (x2[8]=java.lang.Object(LinkedList(x2[9], x3[9]))∧x3[8]=x4[9]∧x1[8]=java.lang.Object(LinkedList(41, x1[9])) ⇒ 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9])))≥6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥))

We simplified constraint (811) using rule (III) which results in the following new constraint:
(812)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x3[8], java.lang.Object(LinkedList(41, x1[9])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x3[8], java.lang.Object(LinkedList(41, x1[9])))≥6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x3[8])), x1[9])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥))

We simplified constraint (812) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(813)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧[248 + (-1)bso_74] + [3]x1[9] ≥ 0)

We simplified constraint (813) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(814)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧[248 + (-1)bso_74] + [3]x1[9] ≥ 0)

We simplified constraint (814) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(815)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧[248 + (-1)bso_74] + [3]x1[9] ≥ 0)

We simplified constraint (815) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(816)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[248 + (-1)bso_74] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9]))) → 6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9]), 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9]))) → 6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9]) which results in the following constraint:
(817)    (x3[9]=java.lang.Object(LinkedList(x2[9]1, x3[9]1))∧java.lang.Object(LinkedList(x2[9], x4[9]))=x4[9]1∧x1[9]=java.lang.Object(LinkedList(41, x1[9]1)) ⇒ 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9]1, x3[9]1)), x4[9]1, java.lang.Object(LinkedList(41, x1[9]1)))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9]1, x3[9]1)), x4[9]1, java.lang.Object(LinkedList(41, x1[9]1)))≥6432_0_TOPOSTFIX_NULL(x3[9]1, java.lang.Object(LinkedList(x2[9]1, x4[9]1)), x1[9]1)∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9]1, java.lang.Object(LinkedList(x2[9]1, x4[9]1)), x1[9]1)), ≥))

We simplified constraint (817) using rule (III) which results in the following new constraint:
(818)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9]1, x3[9]1)), java.lang.Object(LinkedList(x2[9], x4[9])), java.lang.Object(LinkedList(41, x1[9]1)))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9]1, x3[9]1)), java.lang.Object(LinkedList(x2[9], x4[9])), java.lang.Object(LinkedList(41, x1[9]1)))≥6432_0_TOPOSTFIX_NULL(x3[9]1, java.lang.Object(LinkedList(x2[9]1, java.lang.Object(LinkedList(x2[9], x4[9])))), x1[9]1)∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9]1, java.lang.Object(LinkedList(x2[9]1, x4[9]1)), x1[9]1)), ≥))

We simplified constraint (818) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(819)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9]1, java.lang.Object(LinkedList(x2[9]1, x4[9]1)), x1[9]1)), ≥)∧[248 + (-1)bso_74] + [3]x1[9]1 ≥ 0)

We simplified constraint (819) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(820)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9]1, java.lang.Object(LinkedList(x2[9]1, x4[9]1)), x1[9]1)), ≥)∧[248 + (-1)bso_74] + [3]x1[9]1 ≥ 0)

We simplified constraint (820) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(821)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9]1, java.lang.Object(LinkedList(x2[9]1, x4[9]1)), x1[9]1)), ≥)∧[248 + (-1)bso_74] + [3]x1[9]1 ≥ 0)

We simplified constraint (821) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(822)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9]1, java.lang.Object(LinkedList(x2[9]1, x4[9]1)), x1[9]1)), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[248 + (-1)bso_74] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10]), 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9]))) → 6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9]) which results in the following constraint:
(823)    (java.lang.Object(LinkedList(42, x2[10]))=java.lang.Object(LinkedList(x2[9], x3[9]))∧x3[10]=x4[9]∧x1[10]=java.lang.Object(LinkedList(41, x1[9])) ⇒ 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9])))≥6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥))

We simplified constraint (823) using rules (I), (II), (III) which results in the following new constraint:
(824)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], java.lang.Object(LinkedList(41, x1[9])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], java.lang.Object(LinkedList(41, x1[9])))≥6432_0_TOPOSTFIX_NULL(x2[10], java.lang.Object(LinkedList(42, x3[10])), x1[9])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥))

We simplified constraint (824) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(825)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧[248 + (-1)bso_74] + [3]x1[9] ≥ 0)

We simplified constraint (825) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(826)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧[248 + (-1)bso_74] + [3]x1[9] ≥ 0)

We simplified constraint (826) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(827)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧[248 + (-1)bso_74] + [3]x1[9] ≥ 0)

We simplified constraint (827) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(828)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧0 ≥ 0∧0 ≥ 0∧[248 + (-1)bso_74] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11]), 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9]))) → 6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9]) which results in the following constraint:
(829)    (java.lang.Object(LinkedList(43, x2[11]))=java.lang.Object(LinkedList(x2[9], x3[9]))∧x3[11]=x4[9]∧x1[11]=java.lang.Object(LinkedList(41, x1[9])) ⇒ 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9])))≥6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥))

We simplified constraint (829) using rules (I), (II), (III) which results in the following new constraint:
(830)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], java.lang.Object(LinkedList(41, x1[9])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], java.lang.Object(LinkedList(41, x1[9])))≥6432_0_TOPOSTFIX_NULL(x2[11], java.lang.Object(LinkedList(43, x3[11])), x1[9])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥))

We simplified constraint (830) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(831)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧[248 + (-1)bso_74] + [3]x1[9] ≥ 0)

We simplified constraint (831) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(832)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧[248 + (-1)bso_74] + [3]x1[9] ≥ 0)

We simplified constraint (832) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(833)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧[248 + (-1)bso_74] + [3]x1[9] ≥ 0)

We simplified constraint (833) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(834)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧0 ≥ 0∧0 ≥ 0∧[248 + (-1)bso_74] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12]))) → 6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12]), 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9]))) → 6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9]) which results in the following constraint:
(835)    (x2[12]=java.lang.Object(LinkedList(x2[9], x3[9]))∧java.lang.Object(LinkedList(44, x3[12]))=x4[9]∧x1[12]=java.lang.Object(LinkedList(41, x1[9])) ⇒ 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9])))≥6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥))

We simplified constraint (835) using rule (III) which results in the following new constraint:
(836)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), java.lang.Object(LinkedList(44, x3[12])), java.lang.Object(LinkedList(41, x1[9])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), java.lang.Object(LinkedList(44, x3[12])), java.lang.Object(LinkedList(41, x1[9])))≥6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], java.lang.Object(LinkedList(44, x3[12])))), x1[9])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥))

We simplified constraint (836) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(837)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧[248 + (-1)bso_74] + [3]x1[9] ≥ 0)

We simplified constraint (837) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(838)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧[248 + (-1)bso_74] + [3]x1[9] ≥ 0)

We simplified constraint (838) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(839)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧[248 + (-1)bso_74] + [3]x1[9] ≥ 0)

We simplified constraint (839) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(840)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[248 + (-1)bso_74] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13]), 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9]))) → 6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9]) which results in the following constraint:
(841)    (java.lang.Object(LinkedList(45, x2[13]))=java.lang.Object(LinkedList(x2[9], x3[9]))∧x3[13]=x4[9]∧x1[13]=java.lang.Object(LinkedList(41, x1[9])) ⇒ 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9])))≥6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥))

We simplified constraint (841) using rules (I), (II), (III) which results in the following new constraint:
(842)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], java.lang.Object(LinkedList(41, x1[9])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], java.lang.Object(LinkedList(41, x1[9])))≥6432_0_TOPOSTFIX_NULL(x2[13], java.lang.Object(LinkedList(45, x3[13])), x1[9])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥))

We simplified constraint (842) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(843)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧[248 + (-1)bso_74] + [3]x1[9] ≥ 0)

We simplified constraint (843) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(844)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧[248 + (-1)bso_74] + [3]x1[9] ≥ 0)

We simplified constraint (844) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(845)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧[248 + (-1)bso_74] + [3]x1[9] ≥ 0)

We simplified constraint (845) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(846)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧0 ≥ 0∧0 ≥ 0∧[248 + (-1)bso_74] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14]))) → 6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14]), 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9]))) → 6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9]) which results in the following constraint:
(847)    (x2[14]=java.lang.Object(LinkedList(x2[9], x3[9]))∧java.lang.Object(LinkedList(46, x3[14]))=x4[9]∧x1[14]=java.lang.Object(LinkedList(41, x1[9])) ⇒ 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9])))≥6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥))

We simplified constraint (847) using rule (III) which results in the following new constraint:
(848)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), java.lang.Object(LinkedList(46, x3[14])), java.lang.Object(LinkedList(41, x1[9])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), java.lang.Object(LinkedList(46, x3[14])), java.lang.Object(LinkedList(41, x1[9])))≥6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], java.lang.Object(LinkedList(46, x3[14])))), x1[9])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥))

We simplified constraint (848) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(849)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧[248 + (-1)bso_74] + [3]x1[9] ≥ 0)

We simplified constraint (849) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(850)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧[248 + (-1)bso_74] + [3]x1[9] ≥ 0)

We simplified constraint (850) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(851)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧[248 + (-1)bso_74] + [3]x1[9] ≥ 0)

We simplified constraint (851) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(852)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[248 + (-1)bso_74] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15]), 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9]))) → 6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9]) which results in the following constraint:
(853)    (java.lang.Object(LinkedList(47, x2[15]))=java.lang.Object(LinkedList(x2[9], x3[9]))∧x3[15]=x4[9]∧x1[15]=java.lang.Object(LinkedList(41, x1[9])) ⇒ 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9])))≥6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥))

We simplified constraint (853) using rules (I), (II), (III) which results in the following new constraint:
(854)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], java.lang.Object(LinkedList(41, x1[9])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], java.lang.Object(LinkedList(41, x1[9])))≥6432_0_TOPOSTFIX_NULL(x2[15], java.lang.Object(LinkedList(47, x3[15])), x1[9])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥))

We simplified constraint (854) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(855)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧[248 + (-1)bso_74] + [3]x1[9] ≥ 0)

We simplified constraint (855) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(856)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧[248 + (-1)bso_74] + [3]x1[9] ≥ 0)

We simplified constraint (856) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(857)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧[248 + (-1)bso_74] + [3]x1[9] ≥ 0)

We simplified constraint (857) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(858)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧0 ≥ 0∧0 ≥ 0∧[248 + (-1)bso_74] ≥ 0∧[1] ≥ 0)
We consider the chain 6715_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(44, x1[17])), x2[17], x3[17]) → 6432_0_TOPOSTFIX_NULL(x2[17], java.lang.Object(LinkedList(44, x3[17])), x1[17]), 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9]))) → 6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9]) which results in the following constraint:
(859)    (x2[17]=java.lang.Object(LinkedList(x2[9], x3[9]))∧java.lang.Object(LinkedList(44, x3[17]))=x4[9]∧x1[17]=java.lang.Object(LinkedList(41, x1[9])) ⇒ 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9])))≥6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥))

We simplified constraint (859) using rule (III) which results in the following new constraint:
(860)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), java.lang.Object(LinkedList(44, x3[17])), java.lang.Object(LinkedList(41, x1[9])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), java.lang.Object(LinkedList(44, x3[17])), java.lang.Object(LinkedList(41, x1[9])))≥6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], java.lang.Object(LinkedList(44, x3[17])))), x1[9])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥))

We simplified constraint (860) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(861)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧[248 + (-1)bso_74] + [3]x1[9] ≥ 0)

We simplified constraint (861) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(862)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧[248 + (-1)bso_74] + [3]x1[9] ≥ 0)

We simplified constraint (862) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(863)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧[248 + (-1)bso_74] + [3]x1[9] ≥ 0)

We simplified constraint (863) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(864)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[248 + (-1)bso_74] ≥ 0∧[1] ≥ 0)
We consider the chain 6725_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(46, x1[18])), x2[18], x3[18]) → 6432_0_TOPOSTFIX_NULL(x2[18], java.lang.Object(LinkedList(46, x3[18])), x1[18]), 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9]))) → 6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9]) which results in the following constraint:
(865)    (x2[18]=java.lang.Object(LinkedList(x2[9], x3[9]))∧java.lang.Object(LinkedList(46, x3[18]))=x4[9]∧x1[18]=java.lang.Object(LinkedList(41, x1[9])) ⇒ 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9])))≥6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥))

We simplified constraint (865) using rule (III) which results in the following new constraint:
(866)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), java.lang.Object(LinkedList(46, x3[18])), java.lang.Object(LinkedList(41, x1[9])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), java.lang.Object(LinkedList(46, x3[18])), java.lang.Object(LinkedList(41, x1[9])))≥6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], java.lang.Object(LinkedList(46, x3[18])))), x1[9])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥))

We simplified constraint (866) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(867)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧[248 + (-1)bso_74] + [3]x1[9] ≥ 0)

We simplified constraint (867) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(868)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧[248 + (-1)bso_74] + [3]x1[9] ≥ 0)

We simplified constraint (868) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(869)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧[248 + (-1)bso_74] + [3]x1[9] ≥ 0)

We simplified constraint (869) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(870)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[248 + (-1)bso_74] ≥ 0∧[1] ≥ 0)

For Pair 6432_0_TOPOSTFIX_NULL(x2, x3, java.lang.Object(LinkedList(42, x1))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2)), x3, x1) the following chains were created:

We consider the chain 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0]) → 6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0]), 6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10]) which results in the following constraint:
(871)    (x0[0]=x2[10]∧x1[0]=x3[10]∧x2[0]=java.lang.Object(LinkedList(42, x1[10])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥))

We simplified constraint (871) using rule (III) which results in the following new constraint:
(872)    (6432_0_TOPOSTFIX_NULL(x0[0], x1[0], java.lang.Object(LinkedList(42, x1[10])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x0[0], x1[0], java.lang.Object(LinkedList(42, x1[10])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x0[0])), x1[0], x1[10])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥))

We simplified constraint (872) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(873)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧[254 + (-1)bso_76] + [3]x1[10] ≥ 0)

We simplified constraint (873) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(874)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧[254 + (-1)bso_76] + [3]x1[10] ≥ 0)

We simplified constraint (874) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(875)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧[254 + (-1)bso_76] + [3]x1[10] ≥ 0)

We simplified constraint (875) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(876)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧0 ≥ 0∧0 ≥ 0∧[254 + (-1)bso_76] ≥ 0∧[1] ≥ 0)
We consider the chain 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]) → 6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]), 6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10]) which results in the following constraint:
(877)    (x0[1]=x2[10]∧java.lang.Object(LinkedList(x1[1], x2[1]))=x3[10]∧x3[1]=java.lang.Object(LinkedList(42, x1[10])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥))

We simplified constraint (877) using rule (III) which results in the following new constraint:
(878)    (6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(42, x1[10])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(42, x1[10])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x0[1])), java.lang.Object(LinkedList(x1[1], x2[1])), x1[10])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥))

We simplified constraint (878) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(879)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧[254 + (-1)bso_76] + [3]x1[10] ≥ 0)

We simplified constraint (879) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(880)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧[254 + (-1)bso_76] + [3]x1[10] ≥ 0)

We simplified constraint (880) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(881)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧[254 + (-1)bso_76] + [3]x1[10] ≥ 0)

We simplified constraint (881) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(882)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[254 + (-1)bso_76] ≥ 0∧[1] ≥ 0)
We consider the chain 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]), 6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10]) which results in the following constraint:
(883)    (java.lang.Object(LinkedList(42, x1[2]))=x2[10]∧x2[2]=x3[10]∧x3[2]=java.lang.Object(LinkedList(42, x1[10])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥))

We simplified constraint (883) using rule (III) which results in the following new constraint:
(884)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(42, x1[10])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(42, x1[10])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, java.lang.Object(LinkedList(42, x1[2])))), x2[2], x1[10])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥))

We simplified constraint (884) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(885)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧[254 + (-1)bso_76] + [3]x1[10] ≥ 0)

We simplified constraint (885) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(886)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧[254 + (-1)bso_76] + [3]x1[10] ≥ 0)

We simplified constraint (886) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(887)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧[254 + (-1)bso_76] + [3]x1[10] ≥ 0)

We simplified constraint (887) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(888)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧0 ≥ 0∧0 ≥ 0∧[254 + (-1)bso_76] ≥ 0∧[1] ≥ 0)
We consider the chain 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]), 6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10]) which results in the following constraint:
(889)    (java.lang.Object(LinkedList(43, x1[3]))=x2[10]∧x2[3]=x3[10]∧x3[3]=java.lang.Object(LinkedList(42, x1[10])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥))

We simplified constraint (889) using rule (III) which results in the following new constraint:
(890)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(42, x1[10])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(42, x1[10])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, java.lang.Object(LinkedList(43, x1[3])))), x2[3], x1[10])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥))

We simplified constraint (890) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(891)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧[254 + (-1)bso_76] + [3]x1[10] ≥ 0)

We simplified constraint (891) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(892)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧[254 + (-1)bso_76] + [3]x1[10] ≥ 0)

We simplified constraint (892) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(893)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧[254 + (-1)bso_76] + [3]x1[10] ≥ 0)

We simplified constraint (893) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(894)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧0 ≥ 0∧0 ≥ 0∧[254 + (-1)bso_76] ≥ 0∧[1] ≥ 0)
We consider the chain 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]), 6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10]) which results in the following constraint:
(895)    (java.lang.Object(LinkedList(45, x1[4]))=x2[10]∧x2[4]=x3[10]∧x3[4]=java.lang.Object(LinkedList(42, x1[10])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥))

We simplified constraint (895) using rule (III) which results in the following new constraint:
(896)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(42, x1[10])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(42, x1[10])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, java.lang.Object(LinkedList(45, x1[4])))), x2[4], x1[10])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥))

We simplified constraint (896) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(897)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧[254 + (-1)bso_76] + [3]x1[10] ≥ 0)

We simplified constraint (897) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(898)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧[254 + (-1)bso_76] + [3]x1[10] ≥ 0)

We simplified constraint (898) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(899)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧[254 + (-1)bso_76] + [3]x1[10] ≥ 0)

We simplified constraint (899) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(900)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧0 ≥ 0∧0 ≥ 0∧[254 + (-1)bso_76] ≥ 0∧[1] ≥ 0)
We consider the chain 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]), 6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10]) which results in the following constraint:
(901)    (java.lang.Object(LinkedList(47, x1[5]))=x2[10]∧x2[5]=x3[10]∧x3[5]=java.lang.Object(LinkedList(42, x1[10])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥))

We simplified constraint (901) using rule (III) which results in the following new constraint:
(902)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(42, x1[10])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(42, x1[10])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, java.lang.Object(LinkedList(47, x1[5])))), x2[5], x1[10])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥))

We simplified constraint (902) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(903)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧[254 + (-1)bso_76] + [3]x1[10] ≥ 0)

We simplified constraint (903) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(904)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧[254 + (-1)bso_76] + [3]x1[10] ≥ 0)

We simplified constraint (904) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(905)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧[254 + (-1)bso_76] + [3]x1[10] ≥ 0)

We simplified constraint (905) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(906)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧0 ≥ 0∧0 ≥ 0∧[254 + (-1)bso_76] ≥ 0∧[1] ≥ 0)
We consider the chain COND_6432_0_TOPOSTFIX_NULL(TRUE, x2[7], x3[7], java.lang.Object(LinkedList(x0[7], x1[7]))) → 6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), x1[7]), 6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10]) which results in the following constraint:
(907)    (x2[7]=x2[10]∧java.lang.Object(LinkedList(x0[7], x3[7]))=x3[10]∧x1[7]=java.lang.Object(LinkedList(42, x1[10])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥))

We simplified constraint (907) using rule (III) which results in the following new constraint:
(908)    (6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), java.lang.Object(LinkedList(42, x1[10])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), java.lang.Object(LinkedList(42, x1[10])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[7])), java.lang.Object(LinkedList(x0[7], x3[7])), x1[10])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥))

We simplified constraint (908) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(909)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧[254 + (-1)bso_76] + [3]x1[10] ≥ 0)

We simplified constraint (909) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(910)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧[254 + (-1)bso_76] + [3]x1[10] ≥ 0)

We simplified constraint (910) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(911)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧[254 + (-1)bso_76] + [3]x1[10] ≥ 0)

We simplified constraint (911) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(912)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[254 + (-1)bso_76] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8]))) → 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8]), 6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10]) which results in the following constraint:
(913)    (x2[8]=x2[10]∧x3[8]=x3[10]∧x1[8]=java.lang.Object(LinkedList(42, x1[10])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥))

We simplified constraint (913) using rule (III) which results in the following new constraint:
(914)    (6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(42, x1[10])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(42, x1[10])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[8])), x3[8], x1[10])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥))

We simplified constraint (914) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(915)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧[254 + (-1)bso_76] + [3]x1[10] ≥ 0)

We simplified constraint (915) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(916)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧[254 + (-1)bso_76] + [3]x1[10] ≥ 0)

We simplified constraint (916) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(917)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧[254 + (-1)bso_76] + [3]x1[10] ≥ 0)

We simplified constraint (917) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(918)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧0 ≥ 0∧0 ≥ 0∧[254 + (-1)bso_76] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9]))) → 6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9]), 6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10]) which results in the following constraint:
(919)    (x3[9]=x2[10]∧java.lang.Object(LinkedList(x2[9], x4[9]))=x3[10]∧x1[9]=java.lang.Object(LinkedList(42, x1[10])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥))

We simplified constraint (919) using rule (III) which results in the following new constraint:
(920)    (6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), java.lang.Object(LinkedList(42, x1[10])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), java.lang.Object(LinkedList(42, x1[10])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x3[9])), java.lang.Object(LinkedList(x2[9], x4[9])), x1[10])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥))

We simplified constraint (920) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(921)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧[254 + (-1)bso_76] + [3]x1[10] ≥ 0)

We simplified constraint (921) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(922)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧[254 + (-1)bso_76] + [3]x1[10] ≥ 0)

We simplified constraint (922) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(923)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧[254 + (-1)bso_76] + [3]x1[10] ≥ 0)

We simplified constraint (923) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(924)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[254 + (-1)bso_76] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10]), 6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10]) which results in the following constraint:
(925)    (java.lang.Object(LinkedList(42, x2[10]))=x2[10]1∧x3[10]=x3[10]1∧x1[10]=java.lang.Object(LinkedList(42, x1[10]1)) ⇒ 6432_0_TOPOSTFIX_NULL(x2[10]1, x3[10]1, java.lang.Object(LinkedList(42, x1[10]1)))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[10]1, x3[10]1, java.lang.Object(LinkedList(42, x1[10]1)))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10]1)), x3[10]1, x1[10]1)∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10]1)), x3[10]1, x1[10]1)), ≥))

We simplified constraint (925) using rule (III) which results in the following new constraint:
(926)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], java.lang.Object(LinkedList(42, x1[10]1)))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], java.lang.Object(LinkedList(42, x1[10]1)))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, java.lang.Object(LinkedList(42, x2[10])))), x3[10], x1[10]1)∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10]1)), x3[10]1, x1[10]1)), ≥))

We simplified constraint (926) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(927)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10]1)), x3[10]1, x1[10]1)), ≥)∧[254 + (-1)bso_76] + [3]x1[10]1 ≥ 0)

We simplified constraint (927) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(928)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10]1)), x3[10]1, x1[10]1)), ≥)∧[254 + (-1)bso_76] + [3]x1[10]1 ≥ 0)

We simplified constraint (928) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(929)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10]1)), x3[10]1, x1[10]1)), ≥)∧[254 + (-1)bso_76] + [3]x1[10]1 ≥ 0)

We simplified constraint (929) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(930)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10]1)), x3[10]1, x1[10]1)), ≥)∧0 ≥ 0∧0 ≥ 0∧[254 + (-1)bso_76] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11]), 6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10]) which results in the following constraint:
(931)    (java.lang.Object(LinkedList(43, x2[11]))=x2[10]∧x3[11]=x3[10]∧x1[11]=java.lang.Object(LinkedList(42, x1[10])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥))

We simplified constraint (931) using rule (III) which results in the following new constraint:
(932)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], java.lang.Object(LinkedList(42, x1[10])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], java.lang.Object(LinkedList(42, x1[10])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, java.lang.Object(LinkedList(43, x2[11])))), x3[11], x1[10])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥))

We simplified constraint (932) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(933)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧[254 + (-1)bso_76] + [3]x1[10] ≥ 0)

We simplified constraint (933) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(934)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧[254 + (-1)bso_76] + [3]x1[10] ≥ 0)

We simplified constraint (934) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(935)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧[254 + (-1)bso_76] + [3]x1[10] ≥ 0)

We simplified constraint (935) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(936)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧0 ≥ 0∧0 ≥ 0∧[254 + (-1)bso_76] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12]))) → 6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12]), 6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10]) which results in the following constraint:
(937)    (x2[12]=x2[10]∧java.lang.Object(LinkedList(44, x3[12]))=x3[10]∧x1[12]=java.lang.Object(LinkedList(42, x1[10])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥))

We simplified constraint (937) using rule (III) which results in the following new constraint:
(938)    (6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), java.lang.Object(LinkedList(42, x1[10])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), java.lang.Object(LinkedList(42, x1[10])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[12])), java.lang.Object(LinkedList(44, x3[12])), x1[10])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥))

We simplified constraint (938) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(939)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧[254 + (-1)bso_76] + [3]x1[10] ≥ 0)

We simplified constraint (939) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(940)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧[254 + (-1)bso_76] + [3]x1[10] ≥ 0)

We simplified constraint (940) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(941)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧[254 + (-1)bso_76] + [3]x1[10] ≥ 0)

We simplified constraint (941) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(942)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧0 ≥ 0∧0 ≥ 0∧[254 + (-1)bso_76] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13]), 6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10]) which results in the following constraint:
(943)    (java.lang.Object(LinkedList(45, x2[13]))=x2[10]∧x3[13]=x3[10]∧x1[13]=java.lang.Object(LinkedList(42, x1[10])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥))

We simplified constraint (943) using rule (III) which results in the following new constraint:
(944)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], java.lang.Object(LinkedList(42, x1[10])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], java.lang.Object(LinkedList(42, x1[10])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, java.lang.Object(LinkedList(45, x2[13])))), x3[13], x1[10])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥))

We simplified constraint (944) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(945)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧[254 + (-1)bso_76] + [3]x1[10] ≥ 0)

We simplified constraint (945) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(946)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧[254 + (-1)bso_76] + [3]x1[10] ≥ 0)

We simplified constraint (946) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(947)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧[254 + (-1)bso_76] + [3]x1[10] ≥ 0)

We simplified constraint (947) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(948)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧0 ≥ 0∧0 ≥ 0∧[254 + (-1)bso_76] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14]))) → 6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14]), 6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10]) which results in the following constraint:
(949)    (x2[14]=x2[10]∧java.lang.Object(LinkedList(46, x3[14]))=x3[10]∧x1[14]=java.lang.Object(LinkedList(42, x1[10])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥))

We simplified constraint (949) using rule (III) which results in the following new constraint:
(950)    (6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), java.lang.Object(LinkedList(42, x1[10])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), java.lang.Object(LinkedList(42, x1[10])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[14])), java.lang.Object(LinkedList(46, x3[14])), x1[10])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥))

We simplified constraint (950) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(951)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧[254 + (-1)bso_76] + [3]x1[10] ≥ 0)

We simplified constraint (951) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(952)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧[254 + (-1)bso_76] + [3]x1[10] ≥ 0)

We simplified constraint (952) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(953)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧[254 + (-1)bso_76] + [3]x1[10] ≥ 0)

We simplified constraint (953) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(954)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧0 ≥ 0∧0 ≥ 0∧[254 + (-1)bso_76] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15]), 6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10]) which results in the following constraint:
(955)    (java.lang.Object(LinkedList(47, x2[15]))=x2[10]∧x3[15]=x3[10]∧x1[15]=java.lang.Object(LinkedList(42, x1[10])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥))

We simplified constraint (955) using rule (III) which results in the following new constraint:
(956)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], java.lang.Object(LinkedList(42, x1[10])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], java.lang.Object(LinkedList(42, x1[10])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, java.lang.Object(LinkedList(47, x2[15])))), x3[15], x1[10])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥))

We simplified constraint (956) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(957)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧[254 + (-1)bso_76] + [3]x1[10] ≥ 0)

We simplified constraint (957) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(958)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧[254 + (-1)bso_76] + [3]x1[10] ≥ 0)

We simplified constraint (958) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(959)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧[254 + (-1)bso_76] + [3]x1[10] ≥ 0)

We simplified constraint (959) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(960)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧0 ≥ 0∧0 ≥ 0∧[254 + (-1)bso_76] ≥ 0∧[1] ≥ 0)
We consider the chain 6715_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(44, x1[17])), x2[17], x3[17]) → 6432_0_TOPOSTFIX_NULL(x2[17], java.lang.Object(LinkedList(44, x3[17])), x1[17]), 6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10]) which results in the following constraint:
(961)    (x2[17]=x2[10]∧java.lang.Object(LinkedList(44, x3[17]))=x3[10]∧x1[17]=java.lang.Object(LinkedList(42, x1[10])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥))

We simplified constraint (961) using rule (III) which results in the following new constraint:
(962)    (6432_0_TOPOSTFIX_NULL(x2[17], java.lang.Object(LinkedList(44, x3[17])), java.lang.Object(LinkedList(42, x1[10])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[17], java.lang.Object(LinkedList(44, x3[17])), java.lang.Object(LinkedList(42, x1[10])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[17])), java.lang.Object(LinkedList(44, x3[17])), x1[10])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥))

We simplified constraint (962) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(963)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧[254 + (-1)bso_76] + [3]x1[10] ≥ 0)

We simplified constraint (963) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(964)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧[254 + (-1)bso_76] + [3]x1[10] ≥ 0)

We simplified constraint (964) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(965)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧[254 + (-1)bso_76] + [3]x1[10] ≥ 0)

We simplified constraint (965) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(966)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧0 ≥ 0∧0 ≥ 0∧[254 + (-1)bso_76] ≥ 0∧[1] ≥ 0)
We consider the chain 6725_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(46, x1[18])), x2[18], x3[18]) → 6432_0_TOPOSTFIX_NULL(x2[18], java.lang.Object(LinkedList(46, x3[18])), x1[18]), 6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10]) which results in the following constraint:
(967)    (x2[18]=x2[10]∧java.lang.Object(LinkedList(46, x3[18]))=x3[10]∧x1[18]=java.lang.Object(LinkedList(42, x1[10])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥))

We simplified constraint (967) using rule (III) which results in the following new constraint:
(968)    (6432_0_TOPOSTFIX_NULL(x2[18], java.lang.Object(LinkedList(46, x3[18])), java.lang.Object(LinkedList(42, x1[10])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[18], java.lang.Object(LinkedList(46, x3[18])), java.lang.Object(LinkedList(42, x1[10])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[18])), java.lang.Object(LinkedList(46, x3[18])), x1[10])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥))

We simplified constraint (968) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(969)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧[254 + (-1)bso_76] + [3]x1[10] ≥ 0)

We simplified constraint (969) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(970)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧[254 + (-1)bso_76] + [3]x1[10] ≥ 0)

We simplified constraint (970) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(971)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧[254 + (-1)bso_76] + [3]x1[10] ≥ 0)

We simplified constraint (971) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(972)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧0 ≥ 0∧0 ≥ 0∧[254 + (-1)bso_76] ≥ 0∧[1] ≥ 0)

For Pair 6432_0_TOPOSTFIX_NULL(x2, x3, java.lang.Object(LinkedList(43, x1))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2)), x3, x1) the following chains were created:

We consider the chain 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0]) → 6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0]), 6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11]) which results in the following constraint:
(973)    (x0[0]=x2[11]∧x1[0]=x3[11]∧x2[0]=java.lang.Object(LinkedList(43, x1[11])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥))

We simplified constraint (973) using rule (III) which results in the following new constraint:
(974)    (6432_0_TOPOSTFIX_NULL(x0[0], x1[0], java.lang.Object(LinkedList(43, x1[11])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x0[0], x1[0], java.lang.Object(LinkedList(43, x1[11])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x0[0])), x1[0], x1[11])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥))

We simplified constraint (974) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(975)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧[260 + (-1)bso_78] + [3]x1[11] ≥ 0)

We simplified constraint (975) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(976)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧[260 + (-1)bso_78] + [3]x1[11] ≥ 0)

We simplified constraint (976) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(977)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧[260 + (-1)bso_78] + [3]x1[11] ≥ 0)

We simplified constraint (977) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(978)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧0 ≥ 0∧0 ≥ 0∧[260 + (-1)bso_78] ≥ 0∧[1] ≥ 0)
We consider the chain 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]) → 6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]), 6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11]) which results in the following constraint:
(979)    (x0[1]=x2[11]∧java.lang.Object(LinkedList(x1[1], x2[1]))=x3[11]∧x3[1]=java.lang.Object(LinkedList(43, x1[11])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥))

We simplified constraint (979) using rule (III) which results in the following new constraint:
(980)    (6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(43, x1[11])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(43, x1[11])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x0[1])), java.lang.Object(LinkedList(x1[1], x2[1])), x1[11])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥))

We simplified constraint (980) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(981)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧[260 + (-1)bso_78] + [3]x1[11] ≥ 0)

We simplified constraint (981) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(982)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧[260 + (-1)bso_78] + [3]x1[11] ≥ 0)

We simplified constraint (982) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(983)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧[260 + (-1)bso_78] + [3]x1[11] ≥ 0)

We simplified constraint (983) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(984)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[260 + (-1)bso_78] ≥ 0∧[1] ≥ 0)
We consider the chain 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]), 6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11]) which results in the following constraint:
(985)    (java.lang.Object(LinkedList(42, x1[2]))=x2[11]∧x2[2]=x3[11]∧x3[2]=java.lang.Object(LinkedList(43, x1[11])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥))

We simplified constraint (985) using rule (III) which results in the following new constraint:
(986)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(43, x1[11])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(43, x1[11])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, java.lang.Object(LinkedList(42, x1[2])))), x2[2], x1[11])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥))

We simplified constraint (986) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(987)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧[260 + (-1)bso_78] + [3]x1[11] ≥ 0)

We simplified constraint (987) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(988)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧[260 + (-1)bso_78] + [3]x1[11] ≥ 0)

We simplified constraint (988) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(989)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧[260 + (-1)bso_78] + [3]x1[11] ≥ 0)

We simplified constraint (989) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(990)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧0 ≥ 0∧0 ≥ 0∧[260 + (-1)bso_78] ≥ 0∧[1] ≥ 0)
We consider the chain 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]), 6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11]) which results in the following constraint:
(991)    (java.lang.Object(LinkedList(43, x1[3]))=x2[11]∧x2[3]=x3[11]∧x3[3]=java.lang.Object(LinkedList(43, x1[11])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥))

We simplified constraint (991) using rule (III) which results in the following new constraint:
(992)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(43, x1[11])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(43, x1[11])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, java.lang.Object(LinkedList(43, x1[3])))), x2[3], x1[11])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥))

We simplified constraint (992) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(993)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧[260 + (-1)bso_78] + [3]x1[11] ≥ 0)

We simplified constraint (993) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(994)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧[260 + (-1)bso_78] + [3]x1[11] ≥ 0)

We simplified constraint (994) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(995)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧[260 + (-1)bso_78] + [3]x1[11] ≥ 0)

We simplified constraint (995) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(996)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧0 ≥ 0∧0 ≥ 0∧[260 + (-1)bso_78] ≥ 0∧[1] ≥ 0)
We consider the chain 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]), 6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11]) which results in the following constraint:
(997)    (java.lang.Object(LinkedList(45, x1[4]))=x2[11]∧x2[4]=x3[11]∧x3[4]=java.lang.Object(LinkedList(43, x1[11])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥))

We simplified constraint (997) using rule (III) which results in the following new constraint:
(998)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(43, x1[11])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(43, x1[11])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, java.lang.Object(LinkedList(45, x1[4])))), x2[4], x1[11])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥))

We simplified constraint (998) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(999)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧[260 + (-1)bso_78] + [3]x1[11] ≥ 0)

We simplified constraint (999) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1000)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧[260 + (-1)bso_78] + [3]x1[11] ≥ 0)

We simplified constraint (1000) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1001)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧[260 + (-1)bso_78] + [3]x1[11] ≥ 0)

We simplified constraint (1001) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1002)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧0 ≥ 0∧0 ≥ 0∧[260 + (-1)bso_78] ≥ 0∧[1] ≥ 0)
We consider the chain 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]), 6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11]) which results in the following constraint:
(1003)    (java.lang.Object(LinkedList(47, x1[5]))=x2[11]∧x2[5]=x3[11]∧x3[5]=java.lang.Object(LinkedList(43, x1[11])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥))

We simplified constraint (1003) using rule (III) which results in the following new constraint:
(1004)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(43, x1[11])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(43, x1[11])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, java.lang.Object(LinkedList(47, x1[5])))), x2[5], x1[11])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥))

We simplified constraint (1004) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1005)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧[260 + (-1)bso_78] + [3]x1[11] ≥ 0)

We simplified constraint (1005) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1006)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧[260 + (-1)bso_78] + [3]x1[11] ≥ 0)

We simplified constraint (1006) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1007)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧[260 + (-1)bso_78] + [3]x1[11] ≥ 0)

We simplified constraint (1007) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1008)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧0 ≥ 0∧0 ≥ 0∧[260 + (-1)bso_78] ≥ 0∧[1] ≥ 0)
We consider the chain COND_6432_0_TOPOSTFIX_NULL(TRUE, x2[7], x3[7], java.lang.Object(LinkedList(x0[7], x1[7]))) → 6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), x1[7]), 6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11]) which results in the following constraint:
(1009)    (x2[7]=x2[11]∧java.lang.Object(LinkedList(x0[7], x3[7]))=x3[11]∧x1[7]=java.lang.Object(LinkedList(43, x1[11])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥))

We simplified constraint (1009) using rule (III) which results in the following new constraint:
(1010)    (6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), java.lang.Object(LinkedList(43, x1[11])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), java.lang.Object(LinkedList(43, x1[11])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[7])), java.lang.Object(LinkedList(x0[7], x3[7])), x1[11])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥))

We simplified constraint (1010) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1011)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧[260 + (-1)bso_78] + [3]x1[11] ≥ 0)

We simplified constraint (1011) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1012)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧[260 + (-1)bso_78] + [3]x1[11] ≥ 0)

We simplified constraint (1012) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1013)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧[260 + (-1)bso_78] + [3]x1[11] ≥ 0)

We simplified constraint (1013) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1014)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[260 + (-1)bso_78] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8]))) → 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8]), 6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11]) which results in the following constraint:
(1015)    (x2[8]=x2[11]∧x3[8]=x3[11]∧x1[8]=java.lang.Object(LinkedList(43, x1[11])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥))

We simplified constraint (1015) using rule (III) which results in the following new constraint:
(1016)    (6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(43, x1[11])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(43, x1[11])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[8])), x3[8], x1[11])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥))

We simplified constraint (1016) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1017)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧[260 + (-1)bso_78] + [3]x1[11] ≥ 0)

We simplified constraint (1017) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1018)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧[260 + (-1)bso_78] + [3]x1[11] ≥ 0)

We simplified constraint (1018) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1019)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧[260 + (-1)bso_78] + [3]x1[11] ≥ 0)

We simplified constraint (1019) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1020)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧0 ≥ 0∧0 ≥ 0∧[260 + (-1)bso_78] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9]))) → 6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9]), 6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11]) which results in the following constraint:
(1021)    (x3[9]=x2[11]∧java.lang.Object(LinkedList(x2[9], x4[9]))=x3[11]∧x1[9]=java.lang.Object(LinkedList(43, x1[11])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥))

We simplified constraint (1021) using rule (III) which results in the following new constraint:
(1022)    (6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), java.lang.Object(LinkedList(43, x1[11])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), java.lang.Object(LinkedList(43, x1[11])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x3[9])), java.lang.Object(LinkedList(x2[9], x4[9])), x1[11])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥))

We simplified constraint (1022) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1023)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧[260 + (-1)bso_78] + [3]x1[11] ≥ 0)

We simplified constraint (1023) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1024)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧[260 + (-1)bso_78] + [3]x1[11] ≥ 0)

We simplified constraint (1024) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1025)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧[260 + (-1)bso_78] + [3]x1[11] ≥ 0)

We simplified constraint (1025) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1026)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[260 + (-1)bso_78] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10]), 6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11]) which results in the following constraint:
(1027)    (java.lang.Object(LinkedList(42, x2[10]))=x2[11]∧x3[10]=x3[11]∧x1[10]=java.lang.Object(LinkedList(43, x1[11])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥))

We simplified constraint (1027) using rule (III) which results in the following new constraint:
(1028)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], java.lang.Object(LinkedList(43, x1[11])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], java.lang.Object(LinkedList(43, x1[11])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, java.lang.Object(LinkedList(42, x2[10])))), x3[10], x1[11])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥))

We simplified constraint (1028) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1029)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧[260 + (-1)bso_78] + [3]x1[11] ≥ 0)

We simplified constraint (1029) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1030)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧[260 + (-1)bso_78] + [3]x1[11] ≥ 0)

We simplified constraint (1030) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1031)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧[260 + (-1)bso_78] + [3]x1[11] ≥ 0)

We simplified constraint (1031) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1032)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧0 ≥ 0∧0 ≥ 0∧[260 + (-1)bso_78] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11]), 6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11]) which results in the following constraint:
(1033)    (java.lang.Object(LinkedList(43, x2[11]))=x2[11]1∧x3[11]=x3[11]1∧x1[11]=java.lang.Object(LinkedList(43, x1[11]1)) ⇒ 6432_0_TOPOSTFIX_NULL(x2[11]1, x3[11]1, java.lang.Object(LinkedList(43, x1[11]1)))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[11]1, x3[11]1, java.lang.Object(LinkedList(43, x1[11]1)))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11]1)), x3[11]1, x1[11]1)∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11]1)), x3[11]1, x1[11]1)), ≥))

We simplified constraint (1033) using rule (III) which results in the following new constraint:
(1034)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], java.lang.Object(LinkedList(43, x1[11]1)))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], java.lang.Object(LinkedList(43, x1[11]1)))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, java.lang.Object(LinkedList(43, x2[11])))), x3[11], x1[11]1)∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11]1)), x3[11]1, x1[11]1)), ≥))

We simplified constraint (1034) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1035)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11]1)), x3[11]1, x1[11]1)), ≥)∧[260 + (-1)bso_78] + [3]x1[11]1 ≥ 0)

We simplified constraint (1035) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1036)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11]1)), x3[11]1, x1[11]1)), ≥)∧[260 + (-1)bso_78] + [3]x1[11]1 ≥ 0)

We simplified constraint (1036) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1037)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11]1)), x3[11]1, x1[11]1)), ≥)∧[260 + (-1)bso_78] + [3]x1[11]1 ≥ 0)

We simplified constraint (1037) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1038)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11]1)), x3[11]1, x1[11]1)), ≥)∧0 ≥ 0∧0 ≥ 0∧[260 + (-1)bso_78] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12]))) → 6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12]), 6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11]) which results in the following constraint:
(1039)    (x2[12]=x2[11]∧java.lang.Object(LinkedList(44, x3[12]))=x3[11]∧x1[12]=java.lang.Object(LinkedList(43, x1[11])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥))

We simplified constraint (1039) using rule (III) which results in the following new constraint:
(1040)    (6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), java.lang.Object(LinkedList(43, x1[11])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), java.lang.Object(LinkedList(43, x1[11])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[12])), java.lang.Object(LinkedList(44, x3[12])), x1[11])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥))

We simplified constraint (1040) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1041)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧[260 + (-1)bso_78] + [3]x1[11] ≥ 0)

We simplified constraint (1041) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1042)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧[260 + (-1)bso_78] + [3]x1[11] ≥ 0)

We simplified constraint (1042) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1043)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧[260 + (-1)bso_78] + [3]x1[11] ≥ 0)

We simplified constraint (1043) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1044)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧0 ≥ 0∧0 ≥ 0∧[260 + (-1)bso_78] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13]), 6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11]) which results in the following constraint:
(1045)    (java.lang.Object(LinkedList(45, x2[13]))=x2[11]∧x3[13]=x3[11]∧x1[13]=java.lang.Object(LinkedList(43, x1[11])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥))

We simplified constraint (1045) using rule (III) which results in the following new constraint:
(1046)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], java.lang.Object(LinkedList(43, x1[11])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], java.lang.Object(LinkedList(43, x1[11])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, java.lang.Object(LinkedList(45, x2[13])))), x3[13], x1[11])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥))

We simplified constraint (1046) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1047)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧[260 + (-1)bso_78] + [3]x1[11] ≥ 0)

We simplified constraint (1047) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1048)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧[260 + (-1)bso_78] + [3]x1[11] ≥ 0)

We simplified constraint (1048) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1049)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧[260 + (-1)bso_78] + [3]x1[11] ≥ 0)

We simplified constraint (1049) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1050)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧0 ≥ 0∧0 ≥ 0∧[260 + (-1)bso_78] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14]))) → 6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14]), 6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11]) which results in the following constraint:
(1051)    (x2[14]=x2[11]∧java.lang.Object(LinkedList(46, x3[14]))=x3[11]∧x1[14]=java.lang.Object(LinkedList(43, x1[11])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥))

We simplified constraint (1051) using rule (III) which results in the following new constraint:
(1052)    (6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), java.lang.Object(LinkedList(43, x1[11])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), java.lang.Object(LinkedList(43, x1[11])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[14])), java.lang.Object(LinkedList(46, x3[14])), x1[11])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥))

We simplified constraint (1052) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1053)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧[260 + (-1)bso_78] + [3]x1[11] ≥ 0)

We simplified constraint (1053) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1054)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧[260 + (-1)bso_78] + [3]x1[11] ≥ 0)

We simplified constraint (1054) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1055)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧[260 + (-1)bso_78] + [3]x1[11] ≥ 0)

We simplified constraint (1055) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1056)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧0 ≥ 0∧0 ≥ 0∧[260 + (-1)bso_78] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15]), 6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11]) which results in the following constraint:
(1057)    (java.lang.Object(LinkedList(47, x2[15]))=x2[11]∧x3[15]=x3[11]∧x1[15]=java.lang.Object(LinkedList(43, x1[11])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥))

We simplified constraint (1057) using rule (III) which results in the following new constraint:
(1058)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], java.lang.Object(LinkedList(43, x1[11])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], java.lang.Object(LinkedList(43, x1[11])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, java.lang.Object(LinkedList(47, x2[15])))), x3[15], x1[11])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥))

We simplified constraint (1058) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1059)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧[260 + (-1)bso_78] + [3]x1[11] ≥ 0)

We simplified constraint (1059) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1060)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧[260 + (-1)bso_78] + [3]x1[11] ≥ 0)

We simplified constraint (1060) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1061)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧[260 + (-1)bso_78] + [3]x1[11] ≥ 0)

We simplified constraint (1061) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1062)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧0 ≥ 0∧0 ≥ 0∧[260 + (-1)bso_78] ≥ 0∧[1] ≥ 0)
We consider the chain 6715_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(44, x1[17])), x2[17], x3[17]) → 6432_0_TOPOSTFIX_NULL(x2[17], java.lang.Object(LinkedList(44, x3[17])), x1[17]), 6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11]) which results in the following constraint:
(1063)    (x2[17]=x2[11]∧java.lang.Object(LinkedList(44, x3[17]))=x3[11]∧x1[17]=java.lang.Object(LinkedList(43, x1[11])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥))

We simplified constraint (1063) using rule (III) which results in the following new constraint:
(1064)    (6432_0_TOPOSTFIX_NULL(x2[17], java.lang.Object(LinkedList(44, x3[17])), java.lang.Object(LinkedList(43, x1[11])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[17], java.lang.Object(LinkedList(44, x3[17])), java.lang.Object(LinkedList(43, x1[11])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[17])), java.lang.Object(LinkedList(44, x3[17])), x1[11])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥))

We simplified constraint (1064) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1065)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧[260 + (-1)bso_78] + [3]x1[11] ≥ 0)

We simplified constraint (1065) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1066)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧[260 + (-1)bso_78] + [3]x1[11] ≥ 0)

We simplified constraint (1066) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1067)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧[260 + (-1)bso_78] + [3]x1[11] ≥ 0)

We simplified constraint (1067) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1068)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧0 ≥ 0∧0 ≥ 0∧[260 + (-1)bso_78] ≥ 0∧[1] ≥ 0)
We consider the chain 6725_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(46, x1[18])), x2[18], x3[18]) → 6432_0_TOPOSTFIX_NULL(x2[18], java.lang.Object(LinkedList(46, x3[18])), x1[18]), 6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11]) which results in the following constraint:
(1069)    (x2[18]=x2[11]∧java.lang.Object(LinkedList(46, x3[18]))=x3[11]∧x1[18]=java.lang.Object(LinkedList(43, x1[11])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥))

We simplified constraint (1069) using rule (III) which results in the following new constraint:
(1070)    (6432_0_TOPOSTFIX_NULL(x2[18], java.lang.Object(LinkedList(46, x3[18])), java.lang.Object(LinkedList(43, x1[11])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[18], java.lang.Object(LinkedList(46, x3[18])), java.lang.Object(LinkedList(43, x1[11])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[18])), java.lang.Object(LinkedList(46, x3[18])), x1[11])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥))

We simplified constraint (1070) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1071)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧[260 + (-1)bso_78] + [3]x1[11] ≥ 0)

We simplified constraint (1071) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1072)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧[260 + (-1)bso_78] + [3]x1[11] ≥ 0)

We simplified constraint (1072) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1073)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧[260 + (-1)bso_78] + [3]x1[11] ≥ 0)

We simplified constraint (1073) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1074)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧0 ≥ 0∧0 ≥ 0∧[260 + (-1)bso_78] ≥ 0∧[1] ≥ 0)

For Pair 6432_0_TOPOSTFIX_NULL(x2, x3, java.lang.Object(LinkedList(44, x1))) → 6432_0_TOPOSTFIX_NULL(x2, java.lang.Object(LinkedList(44, x3)), x1) the following chains were created:

We consider the chain 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0]) → 6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0]), 6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12]))) → 6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12]) which results in the following constraint:
(1075)    (x0[0]=x2[12]∧x1[0]=x3[12]∧x2[0]=java.lang.Object(LinkedList(44, x1[12])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12])))≥6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥))

We simplified constraint (1075) using rule (III) which results in the following new constraint:
(1076)    (6432_0_TOPOSTFIX_NULL(x0[0], x1[0], java.lang.Object(LinkedList(44, x1[12])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x0[0], x1[0], java.lang.Object(LinkedList(44, x1[12])))≥6432_0_TOPOSTFIX_NULL(x0[0], java.lang.Object(LinkedList(44, x1[0])), x1[12])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥))

We simplified constraint (1076) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1077)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧[266 + (-1)bso_80] + [3]x1[12] ≥ 0)

We simplified constraint (1077) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1078)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧[266 + (-1)bso_80] + [3]x1[12] ≥ 0)

We simplified constraint (1078) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1079)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧[266 + (-1)bso_80] + [3]x1[12] ≥ 0)

We simplified constraint (1079) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1080)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧0 ≥ 0∧0 ≥ 0∧[266 + (-1)bso_80] ≥ 0∧[1] ≥ 0)
We consider the chain 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]) → 6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]), 6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12]))) → 6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12]) which results in the following constraint:
(1081)    (x0[1]=x2[12]∧java.lang.Object(LinkedList(x1[1], x2[1]))=x3[12]∧x3[1]=java.lang.Object(LinkedList(44, x1[12])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12])))≥6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥))

We simplified constraint (1081) using rule (III) which results in the following new constraint:
(1082)    (6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(44, x1[12])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(44, x1[12])))≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(44, java.lang.Object(LinkedList(x1[1], x2[1])))), x1[12])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥))

We simplified constraint (1082) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1083)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧[266 + (-1)bso_80] + [3]x1[12] ≥ 0)

We simplified constraint (1083) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1084)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧[266 + (-1)bso_80] + [3]x1[12] ≥ 0)

We simplified constraint (1084) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1085)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧[266 + (-1)bso_80] + [3]x1[12] ≥ 0)

We simplified constraint (1085) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1086)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[266 + (-1)bso_80] ≥ 0∧[1] ≥ 0)
We consider the chain 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]), 6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12]))) → 6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12]) which results in the following constraint:
(1087)    (java.lang.Object(LinkedList(42, x1[2]))=x2[12]∧x2[2]=x3[12]∧x3[2]=java.lang.Object(LinkedList(44, x1[12])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12])))≥6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥))

We simplified constraint (1087) using rule (III) which results in the following new constraint:
(1088)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(44, x1[12])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(44, x1[12])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), java.lang.Object(LinkedList(44, x2[2])), x1[12])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥))

We simplified constraint (1088) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1089)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧[266 + (-1)bso_80] + [3]x1[12] ≥ 0)

We simplified constraint (1089) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1090)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧[266 + (-1)bso_80] + [3]x1[12] ≥ 0)

We simplified constraint (1090) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1091)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧[266 + (-1)bso_80] + [3]x1[12] ≥ 0)

We simplified constraint (1091) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1092)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧0 ≥ 0∧0 ≥ 0∧[266 + (-1)bso_80] ≥ 0∧[1] ≥ 0)
We consider the chain 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]), 6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12]))) → 6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12]) which results in the following constraint:
(1093)    (java.lang.Object(LinkedList(43, x1[3]))=x2[12]∧x2[3]=x3[12]∧x3[3]=java.lang.Object(LinkedList(44, x1[12])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12])))≥6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥))

We simplified constraint (1093) using rule (III) which results in the following new constraint:
(1094)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(44, x1[12])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(44, x1[12])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), java.lang.Object(LinkedList(44, x2[3])), x1[12])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥))

We simplified constraint (1094) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1095)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧[266 + (-1)bso_80] + [3]x1[12] ≥ 0)

We simplified constraint (1095) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1096)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧[266 + (-1)bso_80] + [3]x1[12] ≥ 0)

We simplified constraint (1096) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1097)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧[266 + (-1)bso_80] + [3]x1[12] ≥ 0)

We simplified constraint (1097) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1098)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧0 ≥ 0∧0 ≥ 0∧[266 + (-1)bso_80] ≥ 0∧[1] ≥ 0)
We consider the chain 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]), 6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12]))) → 6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12]) which results in the following constraint:
(1099)    (java.lang.Object(LinkedList(45, x1[4]))=x2[12]∧x2[4]=x3[12]∧x3[4]=java.lang.Object(LinkedList(44, x1[12])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12])))≥6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥))

We simplified constraint (1099) using rule (III) which results in the following new constraint:
(1100)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(44, x1[12])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(44, x1[12])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), java.lang.Object(LinkedList(44, x2[4])), x1[12])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥))

We simplified constraint (1100) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1101)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧[266 + (-1)bso_80] + [3]x1[12] ≥ 0)

We simplified constraint (1101) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1102)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧[266 + (-1)bso_80] + [3]x1[12] ≥ 0)

We simplified constraint (1102) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1103)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧[266 + (-1)bso_80] + [3]x1[12] ≥ 0)

We simplified constraint (1103) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1104)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧0 ≥ 0∧0 ≥ 0∧[266 + (-1)bso_80] ≥ 0∧[1] ≥ 0)
We consider the chain 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]), 6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12]))) → 6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12]) which results in the following constraint:
(1105)    (java.lang.Object(LinkedList(47, x1[5]))=x2[12]∧x2[5]=x3[12]∧x3[5]=java.lang.Object(LinkedList(44, x1[12])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12])))≥6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥))

We simplified constraint (1105) using rule (III) which results in the following new constraint:
(1106)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(44, x1[12])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(44, x1[12])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), java.lang.Object(LinkedList(44, x2[5])), x1[12])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥))

We simplified constraint (1106) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1107)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧[266 + (-1)bso_80] + [3]x1[12] ≥ 0)

We simplified constraint (1107) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1108)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧[266 + (-1)bso_80] + [3]x1[12] ≥ 0)

We simplified constraint (1108) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1109)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧[266 + (-1)bso_80] + [3]x1[12] ≥ 0)

We simplified constraint (1109) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1110)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧0 ≥ 0∧0 ≥ 0∧[266 + (-1)bso_80] ≥ 0∧[1] ≥ 0)
We consider the chain COND_6432_0_TOPOSTFIX_NULL(TRUE, x2[7], x3[7], java.lang.Object(LinkedList(x0[7], x1[7]))) → 6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), x1[7]), 6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12]))) → 6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12]) which results in the following constraint:
(1111)    (x2[7]=x2[12]∧java.lang.Object(LinkedList(x0[7], x3[7]))=x3[12]∧x1[7]=java.lang.Object(LinkedList(44, x1[12])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12])))≥6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥))

We simplified constraint (1111) using rule (III) which results in the following new constraint:
(1112)    (6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), java.lang.Object(LinkedList(44, x1[12])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), java.lang.Object(LinkedList(44, x1[12])))≥6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(44, java.lang.Object(LinkedList(x0[7], x3[7])))), x1[12])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥))

We simplified constraint (1112) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1113)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧[266 + (-1)bso_80] + [3]x1[12] ≥ 0)

We simplified constraint (1113) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1114)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧[266 + (-1)bso_80] + [3]x1[12] ≥ 0)

We simplified constraint (1114) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1115)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧[266 + (-1)bso_80] + [3]x1[12] ≥ 0)

We simplified constraint (1115) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1116)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[266 + (-1)bso_80] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8]))) → 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8]), 6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12]))) → 6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12]) which results in the following constraint:
(1117)    (x2[8]=x2[12]∧x3[8]=x3[12]∧x1[8]=java.lang.Object(LinkedList(44, x1[12])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12])))≥6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥))

We simplified constraint (1117) using rule (III) which results in the following new constraint:
(1118)    (6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(44, x1[12])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(44, x1[12])))≥6432_0_TOPOSTFIX_NULL(x2[8], java.lang.Object(LinkedList(44, x3[8])), x1[12])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥))

We simplified constraint (1118) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1119)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧[266 + (-1)bso_80] + [3]x1[12] ≥ 0)

We simplified constraint (1119) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1120)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧[266 + (-1)bso_80] + [3]x1[12] ≥ 0)

We simplified constraint (1120) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1121)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧[266 + (-1)bso_80] + [3]x1[12] ≥ 0)

We simplified constraint (1121) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1122)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧0 ≥ 0∧0 ≥ 0∧[266 + (-1)bso_80] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9]))) → 6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9]), 6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12]))) → 6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12]) which results in the following constraint:
(1123)    (x3[9]=x2[12]∧java.lang.Object(LinkedList(x2[9], x4[9]))=x3[12]∧x1[9]=java.lang.Object(LinkedList(44, x1[12])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12])))≥6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥))

We simplified constraint (1123) using rule (III) which results in the following new constraint:
(1124)    (6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), java.lang.Object(LinkedList(44, x1[12])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), java.lang.Object(LinkedList(44, x1[12])))≥6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(44, java.lang.Object(LinkedList(x2[9], x4[9])))), x1[12])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥))

We simplified constraint (1124) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1125)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧[266 + (-1)bso_80] + [3]x1[12] ≥ 0)

We simplified constraint (1125) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1126)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧[266 + (-1)bso_80] + [3]x1[12] ≥ 0)

We simplified constraint (1126) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1127)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧[266 + (-1)bso_80] + [3]x1[12] ≥ 0)

We simplified constraint (1127) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1128)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[266 + (-1)bso_80] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10]), 6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12]))) → 6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12]) which results in the following constraint:
(1129)    (java.lang.Object(LinkedList(42, x2[10]))=x2[12]∧x3[10]=x3[12]∧x1[10]=java.lang.Object(LinkedList(44, x1[12])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12])))≥6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥))

We simplified constraint (1129) using rule (III) which results in the following new constraint:
(1130)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], java.lang.Object(LinkedList(44, x1[12])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], java.lang.Object(LinkedList(44, x1[12])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), java.lang.Object(LinkedList(44, x3[10])), x1[12])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥))

We simplified constraint (1130) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1131)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧[266 + (-1)bso_80] + [3]x1[12] ≥ 0)

We simplified constraint (1131) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1132)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧[266 + (-1)bso_80] + [3]x1[12] ≥ 0)

We simplified constraint (1132) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1133)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧[266 + (-1)bso_80] + [3]x1[12] ≥ 0)

We simplified constraint (1133) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1134)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧0 ≥ 0∧0 ≥ 0∧[266 + (-1)bso_80] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11]), 6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12]))) → 6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12]) which results in the following constraint:
(1135)    (java.lang.Object(LinkedList(43, x2[11]))=x2[12]∧x3[11]=x3[12]∧x1[11]=java.lang.Object(LinkedList(44, x1[12])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12])))≥6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥))

We simplified constraint (1135) using rule (III) which results in the following new constraint:
(1136)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], java.lang.Object(LinkedList(44, x1[12])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], java.lang.Object(LinkedList(44, x1[12])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), java.lang.Object(LinkedList(44, x3[11])), x1[12])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥))

We simplified constraint (1136) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1137)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧[266 + (-1)bso_80] + [3]x1[12] ≥ 0)

We simplified constraint (1137) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1138)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧[266 + (-1)bso_80] + [3]x1[12] ≥ 0)

We simplified constraint (1138) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1139)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧[266 + (-1)bso_80] + [3]x1[12] ≥ 0)

We simplified constraint (1139) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1140)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧0 ≥ 0∧0 ≥ 0∧[266 + (-1)bso_80] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12]))) → 6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12]), 6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12]))) → 6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12]) which results in the following constraint:
(1141)    (x2[12]=x2[12]1∧java.lang.Object(LinkedList(44, x3[12]))=x3[12]1∧x1[12]=java.lang.Object(LinkedList(44, x1[12]1)) ⇒ 6432_0_TOPOSTFIX_NULL(x2[12]1, x3[12]1, java.lang.Object(LinkedList(44, x1[12]1)))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[12]1, x3[12]1, java.lang.Object(LinkedList(44, x1[12]1)))≥6432_0_TOPOSTFIX_NULL(x2[12]1, java.lang.Object(LinkedList(44, x3[12]1)), x1[12]1)∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12]1, java.lang.Object(LinkedList(44, x3[12]1)), x1[12]1)), ≥))

We simplified constraint (1141) using rule (III) which results in the following new constraint:
(1142)    (6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), java.lang.Object(LinkedList(44, x1[12]1)))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), java.lang.Object(LinkedList(44, x1[12]1)))≥6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, java.lang.Object(LinkedList(44, x3[12])))), x1[12]1)∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12]1, java.lang.Object(LinkedList(44, x3[12]1)), x1[12]1)), ≥))

We simplified constraint (1142) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1143)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12]1, java.lang.Object(LinkedList(44, x3[12]1)), x1[12]1)), ≥)∧[266 + (-1)bso_80] + [3]x1[12]1 ≥ 0)

We simplified constraint (1143) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1144)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12]1, java.lang.Object(LinkedList(44, x3[12]1)), x1[12]1)), ≥)∧[266 + (-1)bso_80] + [3]x1[12]1 ≥ 0)

We simplified constraint (1144) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1145)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12]1, java.lang.Object(LinkedList(44, x3[12]1)), x1[12]1)), ≥)∧[266 + (-1)bso_80] + [3]x1[12]1 ≥ 0)

We simplified constraint (1145) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1146)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12]1, java.lang.Object(LinkedList(44, x3[12]1)), x1[12]1)), ≥)∧0 ≥ 0∧0 ≥ 0∧[266 + (-1)bso_80] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13]), 6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12]))) → 6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12]) which results in the following constraint:
(1147)    (java.lang.Object(LinkedList(45, x2[13]))=x2[12]∧x3[13]=x3[12]∧x1[13]=java.lang.Object(LinkedList(44, x1[12])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12])))≥6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥))

We simplified constraint (1147) using rule (III) which results in the following new constraint:
(1148)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], java.lang.Object(LinkedList(44, x1[12])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], java.lang.Object(LinkedList(44, x1[12])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), java.lang.Object(LinkedList(44, x3[13])), x1[12])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥))

We simplified constraint (1148) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1149)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧[266 + (-1)bso_80] + [3]x1[12] ≥ 0)

We simplified constraint (1149) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1150)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧[266 + (-1)bso_80] + [3]x1[12] ≥ 0)

We simplified constraint (1150) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1151)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧[266 + (-1)bso_80] + [3]x1[12] ≥ 0)

We simplified constraint (1151) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1152)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧0 ≥ 0∧0 ≥ 0∧[266 + (-1)bso_80] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14]))) → 6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14]), 6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12]))) → 6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12]) which results in the following constraint:
(1153)    (x2[14]=x2[12]∧java.lang.Object(LinkedList(46, x3[14]))=x3[12]∧x1[14]=java.lang.Object(LinkedList(44, x1[12])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12])))≥6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥))

We simplified constraint (1153) using rule (III) which results in the following new constraint:
(1154)    (6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), java.lang.Object(LinkedList(44, x1[12])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), java.lang.Object(LinkedList(44, x1[12])))≥6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(44, java.lang.Object(LinkedList(46, x3[14])))), x1[12])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥))

We simplified constraint (1154) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1155)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧[266 + (-1)bso_80] + [3]x1[12] ≥ 0)

We simplified constraint (1155) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1156)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧[266 + (-1)bso_80] + [3]x1[12] ≥ 0)

We simplified constraint (1156) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1157)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧[266 + (-1)bso_80] + [3]x1[12] ≥ 0)

We simplified constraint (1157) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1158)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧0 ≥ 0∧0 ≥ 0∧[266 + (-1)bso_80] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15]), 6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12]))) → 6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12]) which results in the following constraint:
(1159)    (java.lang.Object(LinkedList(47, x2[15]))=x2[12]∧x3[15]=x3[12]∧x1[15]=java.lang.Object(LinkedList(44, x1[12])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12])))≥6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥))

We simplified constraint (1159) using rule (III) which results in the following new constraint:
(1160)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], java.lang.Object(LinkedList(44, x1[12])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], java.lang.Object(LinkedList(44, x1[12])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), java.lang.Object(LinkedList(44, x3[15])), x1[12])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥))

We simplified constraint (1160) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1161)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧[266 + (-1)bso_80] + [3]x1[12] ≥ 0)

We simplified constraint (1161) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1162)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧[266 + (-1)bso_80] + [3]x1[12] ≥ 0)

We simplified constraint (1162) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1163)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧[266 + (-1)bso_80] + [3]x1[12] ≥ 0)

We simplified constraint (1163) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1164)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧0 ≥ 0∧0 ≥ 0∧[266 + (-1)bso_80] ≥ 0∧[1] ≥ 0)
We consider the chain 6715_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(44, x1[17])), x2[17], x3[17]) → 6432_0_TOPOSTFIX_NULL(x2[17], java.lang.Object(LinkedList(44, x3[17])), x1[17]), 6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12]))) → 6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12]) which results in the following constraint:
(1165)    (x2[17]=x2[12]∧java.lang.Object(LinkedList(44, x3[17]))=x3[12]∧x1[17]=java.lang.Object(LinkedList(44, x1[12])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12])))≥6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥))

We simplified constraint (1165) using rule (III) which results in the following new constraint:
(1166)    (6432_0_TOPOSTFIX_NULL(x2[17], java.lang.Object(LinkedList(44, x3[17])), java.lang.Object(LinkedList(44, x1[12])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[17], java.lang.Object(LinkedList(44, x3[17])), java.lang.Object(LinkedList(44, x1[12])))≥6432_0_TOPOSTFIX_NULL(x2[17], java.lang.Object(LinkedList(44, java.lang.Object(LinkedList(44, x3[17])))), x1[12])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥))

We simplified constraint (1166) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1167)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧[266 + (-1)bso_80] + [3]x1[12] ≥ 0)

We simplified constraint (1167) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1168)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧[266 + (-1)bso_80] + [3]x1[12] ≥ 0)

We simplified constraint (1168) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1169)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧[266 + (-1)bso_80] + [3]x1[12] ≥ 0)

We simplified constraint (1169) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1170)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧0 ≥ 0∧0 ≥ 0∧[266 + (-1)bso_80] ≥ 0∧[1] ≥ 0)
We consider the chain 6725_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(46, x1[18])), x2[18], x3[18]) → 6432_0_TOPOSTFIX_NULL(x2[18], java.lang.Object(LinkedList(46, x3[18])), x1[18]), 6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12]))) → 6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12]) which results in the following constraint:
(1171)    (x2[18]=x2[12]∧java.lang.Object(LinkedList(46, x3[18]))=x3[12]∧x1[18]=java.lang.Object(LinkedList(44, x1[12])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12])))≥6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥))

We simplified constraint (1171) using rule (III) which results in the following new constraint:
(1172)    (6432_0_TOPOSTFIX_NULL(x2[18], java.lang.Object(LinkedList(46, x3[18])), java.lang.Object(LinkedList(44, x1[12])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[18], java.lang.Object(LinkedList(46, x3[18])), java.lang.Object(LinkedList(44, x1[12])))≥6432_0_TOPOSTFIX_NULL(x2[18], java.lang.Object(LinkedList(44, java.lang.Object(LinkedList(46, x3[18])))), x1[12])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥))

We simplified constraint (1172) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1173)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧[266 + (-1)bso_80] + [3]x1[12] ≥ 0)

We simplified constraint (1173) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1174)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧[266 + (-1)bso_80] + [3]x1[12] ≥ 0)

We simplified constraint (1174) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1175)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧[266 + (-1)bso_80] + [3]x1[12] ≥ 0)

We simplified constraint (1175) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1176)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧0 ≥ 0∧0 ≥ 0∧[266 + (-1)bso_80] ≥ 0∧[1] ≥ 0)

For Pair 6432_0_TOPOSTFIX_NULL(x2, x3, java.lang.Object(LinkedList(45, x1))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2)), x3, x1) the following chains were created:

We consider the chain 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0]) → 6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0]), 6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13]) which results in the following constraint:
(1177)    (x0[0]=x2[13]∧x1[0]=x3[13]∧x2[0]=java.lang.Object(LinkedList(45, x1[13])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥))

We simplified constraint (1177) using rule (III) which results in the following new constraint:
(1178)    (6432_0_TOPOSTFIX_NULL(x0[0], x1[0], java.lang.Object(LinkedList(45, x1[13])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x0[0], x1[0], java.lang.Object(LinkedList(45, x1[13])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x0[0])), x1[0], x1[13])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥))

We simplified constraint (1178) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1179)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧[272 + (-1)bso_82] + [3]x1[13] ≥ 0)

We simplified constraint (1179) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1180)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧[272 + (-1)bso_82] + [3]x1[13] ≥ 0)

We simplified constraint (1180) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1181)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧[272 + (-1)bso_82] + [3]x1[13] ≥ 0)

We simplified constraint (1181) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1182)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧0 ≥ 0∧0 ≥ 0∧[272 + (-1)bso_82] ≥ 0∧[1] ≥ 0)
We consider the chain 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]) → 6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]), 6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13]) which results in the following constraint:
(1183)    (x0[1]=x2[13]∧java.lang.Object(LinkedList(x1[1], x2[1]))=x3[13]∧x3[1]=java.lang.Object(LinkedList(45, x1[13])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥))

We simplified constraint (1183) using rule (III) which results in the following new constraint:
(1184)    (6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(45, x1[13])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(45, x1[13])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x0[1])), java.lang.Object(LinkedList(x1[1], x2[1])), x1[13])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥))

We simplified constraint (1184) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1185)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧[272 + (-1)bso_82] + [3]x1[13] ≥ 0)

We simplified constraint (1185) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1186)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧[272 + (-1)bso_82] + [3]x1[13] ≥ 0)

We simplified constraint (1186) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1187)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧[272 + (-1)bso_82] + [3]x1[13] ≥ 0)

We simplified constraint (1187) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1188)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[272 + (-1)bso_82] ≥ 0∧[1] ≥ 0)
We consider the chain 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]), 6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13]) which results in the following constraint:
(1189)    (java.lang.Object(LinkedList(42, x1[2]))=x2[13]∧x2[2]=x3[13]∧x3[2]=java.lang.Object(LinkedList(45, x1[13])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥))

We simplified constraint (1189) using rule (III) which results in the following new constraint:
(1190)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(45, x1[13])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(45, x1[13])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, java.lang.Object(LinkedList(42, x1[2])))), x2[2], x1[13])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥))

We simplified constraint (1190) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1191)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧[272 + (-1)bso_82] + [3]x1[13] ≥ 0)

We simplified constraint (1191) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1192)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧[272 + (-1)bso_82] + [3]x1[13] ≥ 0)

We simplified constraint (1192) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1193)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧[272 + (-1)bso_82] + [3]x1[13] ≥ 0)

We simplified constraint (1193) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1194)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧0 ≥ 0∧0 ≥ 0∧[272 + (-1)bso_82] ≥ 0∧[1] ≥ 0)
We consider the chain 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]), 6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13]) which results in the following constraint:
(1195)    (java.lang.Object(LinkedList(43, x1[3]))=x2[13]∧x2[3]=x3[13]∧x3[3]=java.lang.Object(LinkedList(45, x1[13])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥))

We simplified constraint (1195) using rule (III) which results in the following new constraint:
(1196)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(45, x1[13])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(45, x1[13])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, java.lang.Object(LinkedList(43, x1[3])))), x2[3], x1[13])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥))

We simplified constraint (1196) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1197)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧[272 + (-1)bso_82] + [3]x1[13] ≥ 0)

We simplified constraint (1197) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1198)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧[272 + (-1)bso_82] + [3]x1[13] ≥ 0)

We simplified constraint (1198) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1199)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧[272 + (-1)bso_82] + [3]x1[13] ≥ 0)

We simplified constraint (1199) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1200)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧0 ≥ 0∧0 ≥ 0∧[272 + (-1)bso_82] ≥ 0∧[1] ≥ 0)
We consider the chain 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]), 6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13]) which results in the following constraint:
(1201)    (java.lang.Object(LinkedList(45, x1[4]))=x2[13]∧x2[4]=x3[13]∧x3[4]=java.lang.Object(LinkedList(45, x1[13])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥))

We simplified constraint (1201) using rule (III) which results in the following new constraint:
(1202)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(45, x1[13])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(45, x1[13])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, java.lang.Object(LinkedList(45, x1[4])))), x2[4], x1[13])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥))

We simplified constraint (1202) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1203)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧[272 + (-1)bso_82] + [3]x1[13] ≥ 0)

We simplified constraint (1203) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1204)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧[272 + (-1)bso_82] + [3]x1[13] ≥ 0)

We simplified constraint (1204) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1205)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧[272 + (-1)bso_82] + [3]x1[13] ≥ 0)

We simplified constraint (1205) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1206)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧0 ≥ 0∧0 ≥ 0∧[272 + (-1)bso_82] ≥ 0∧[1] ≥ 0)
We consider the chain 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]), 6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13]) which results in the following constraint:
(1207)    (java.lang.Object(LinkedList(47, x1[5]))=x2[13]∧x2[5]=x3[13]∧x3[5]=java.lang.Object(LinkedList(45, x1[13])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥))

We simplified constraint (1207) using rule (III) which results in the following new constraint:
(1208)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(45, x1[13])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(45, x1[13])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, java.lang.Object(LinkedList(47, x1[5])))), x2[5], x1[13])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥))

We simplified constraint (1208) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1209)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧[272 + (-1)bso_82] + [3]x1[13] ≥ 0)

We simplified constraint (1209) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1210)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧[272 + (-1)bso_82] + [3]x1[13] ≥ 0)

We simplified constraint (1210) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1211)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧[272 + (-1)bso_82] + [3]x1[13] ≥ 0)

We simplified constraint (1211) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1212)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧0 ≥ 0∧0 ≥ 0∧[272 + (-1)bso_82] ≥ 0∧[1] ≥ 0)
We consider the chain COND_6432_0_TOPOSTFIX_NULL(TRUE, x2[7], x3[7], java.lang.Object(LinkedList(x0[7], x1[7]))) → 6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), x1[7]), 6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13]) which results in the following constraint:
(1213)    (x2[7]=x2[13]∧java.lang.Object(LinkedList(x0[7], x3[7]))=x3[13]∧x1[7]=java.lang.Object(LinkedList(45, x1[13])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥))

We simplified constraint (1213) using rule (III) which results in the following new constraint:
(1214)    (6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), java.lang.Object(LinkedList(45, x1[13])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), java.lang.Object(LinkedList(45, x1[13])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[7])), java.lang.Object(LinkedList(x0[7], x3[7])), x1[13])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥))

We simplified constraint (1214) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1215)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧[272 + (-1)bso_82] + [3]x1[13] ≥ 0)

We simplified constraint (1215) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1216)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧[272 + (-1)bso_82] + [3]x1[13] ≥ 0)

We simplified constraint (1216) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1217)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧[272 + (-1)bso_82] + [3]x1[13] ≥ 0)

We simplified constraint (1217) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1218)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[272 + (-1)bso_82] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8]))) → 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8]), 6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13]) which results in the following constraint:
(1219)    (x2[8]=x2[13]∧x3[8]=x3[13]∧x1[8]=java.lang.Object(LinkedList(45, x1[13])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥))

We simplified constraint (1219) using rule (III) which results in the following new constraint:
(1220)    (6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(45, x1[13])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(45, x1[13])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[8])), x3[8], x1[13])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥))

We simplified constraint (1220) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1221)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧[272 + (-1)bso_82] + [3]x1[13] ≥ 0)

We simplified constraint (1221) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1222)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧[272 + (-1)bso_82] + [3]x1[13] ≥ 0)

We simplified constraint (1222) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1223)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧[272 + (-1)bso_82] + [3]x1[13] ≥ 0)

We simplified constraint (1223) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1224)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧0 ≥ 0∧0 ≥ 0∧[272 + (-1)bso_82] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9]))) → 6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9]), 6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13]) which results in the following constraint:
(1225)    (x3[9]=x2[13]∧java.lang.Object(LinkedList(x2[9], x4[9]))=x3[13]∧x1[9]=java.lang.Object(LinkedList(45, x1[13])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥))

We simplified constraint (1225) using rule (III) which results in the following new constraint:
(1226)    (6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), java.lang.Object(LinkedList(45, x1[13])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), java.lang.Object(LinkedList(45, x1[13])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x3[9])), java.lang.Object(LinkedList(x2[9], x4[9])), x1[13])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥))

We simplified constraint (1226) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1227)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧[272 + (-1)bso_82] + [3]x1[13] ≥ 0)

We simplified constraint (1227) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1228)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧[272 + (-1)bso_82] + [3]x1[13] ≥ 0)

We simplified constraint (1228) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1229)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧[272 + (-1)bso_82] + [3]x1[13] ≥ 0)

We simplified constraint (1229) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1230)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[272 + (-1)bso_82] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10]), 6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13]) which results in the following constraint:
(1231)    (java.lang.Object(LinkedList(42, x2[10]))=x2[13]∧x3[10]=x3[13]∧x1[10]=java.lang.Object(LinkedList(45, x1[13])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥))

We simplified constraint (1231) using rule (III) which results in the following new constraint:
(1232)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], java.lang.Object(LinkedList(45, x1[13])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], java.lang.Object(LinkedList(45, x1[13])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, java.lang.Object(LinkedList(42, x2[10])))), x3[10], x1[13])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥))

We simplified constraint (1232) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1233)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧[272 + (-1)bso_82] + [3]x1[13] ≥ 0)

We simplified constraint (1233) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1234)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧[272 + (-1)bso_82] + [3]x1[13] ≥ 0)

We simplified constraint (1234) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1235)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧[272 + (-1)bso_82] + [3]x1[13] ≥ 0)

We simplified constraint (1235) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1236)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧0 ≥ 0∧0 ≥ 0∧[272 + (-1)bso_82] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11]), 6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13]) which results in the following constraint:
(1237)    (java.lang.Object(LinkedList(43, x2[11]))=x2[13]∧x3[11]=x3[13]∧x1[11]=java.lang.Object(LinkedList(45, x1[13])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥))

We simplified constraint (1237) using rule (III) which results in the following new constraint:
(1238)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], java.lang.Object(LinkedList(45, x1[13])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], java.lang.Object(LinkedList(45, x1[13])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, java.lang.Object(LinkedList(43, x2[11])))), x3[11], x1[13])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥))

We simplified constraint (1238) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1239)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧[272 + (-1)bso_82] + [3]x1[13] ≥ 0)

We simplified constraint (1239) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1240)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧[272 + (-1)bso_82] + [3]x1[13] ≥ 0)

We simplified constraint (1240) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1241)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧[272 + (-1)bso_82] + [3]x1[13] ≥ 0)

We simplified constraint (1241) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1242)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧0 ≥ 0∧0 ≥ 0∧[272 + (-1)bso_82] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12]))) → 6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12]), 6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13]) which results in the following constraint:
(1243)    (x2[12]=x2[13]∧java.lang.Object(LinkedList(44, x3[12]))=x3[13]∧x1[12]=java.lang.Object(LinkedList(45, x1[13])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥))

We simplified constraint (1243) using rule (III) which results in the following new constraint:
(1244)    (6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), java.lang.Object(LinkedList(45, x1[13])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), java.lang.Object(LinkedList(45, x1[13])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[12])), java.lang.Object(LinkedList(44, x3[12])), x1[13])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥))

We simplified constraint (1244) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1245)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧[272 + (-1)bso_82] + [3]x1[13] ≥ 0)

We simplified constraint (1245) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1246)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧[272 + (-1)bso_82] + [3]x1[13] ≥ 0)

We simplified constraint (1246) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1247)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧[272 + (-1)bso_82] + [3]x1[13] ≥ 0)

We simplified constraint (1247) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1248)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧0 ≥ 0∧0 ≥ 0∧[272 + (-1)bso_82] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13]), 6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13]) which results in the following constraint:
(1249)    (java.lang.Object(LinkedList(45, x2[13]))=x2[13]1∧x3[13]=x3[13]1∧x1[13]=java.lang.Object(LinkedList(45, x1[13]1)) ⇒ 6432_0_TOPOSTFIX_NULL(x2[13]1, x3[13]1, java.lang.Object(LinkedList(45, x1[13]1)))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[13]1, x3[13]1, java.lang.Object(LinkedList(45, x1[13]1)))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13]1)), x3[13]1, x1[13]1)∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13]1)), x3[13]1, x1[13]1)), ≥))

We simplified constraint (1249) using rule (III) which results in the following new constraint:
(1250)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], java.lang.Object(LinkedList(45, x1[13]1)))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], java.lang.Object(LinkedList(45, x1[13]1)))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, java.lang.Object(LinkedList(45, x2[13])))), x3[13], x1[13]1)∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13]1)), x3[13]1, x1[13]1)), ≥))

We simplified constraint (1250) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1251)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13]1)), x3[13]1, x1[13]1)), ≥)∧[272 + (-1)bso_82] + [3]x1[13]1 ≥ 0)

We simplified constraint (1251) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1252)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13]1)), x3[13]1, x1[13]1)), ≥)∧[272 + (-1)bso_82] + [3]x1[13]1 ≥ 0)

We simplified constraint (1252) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1253)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13]1)), x3[13]1, x1[13]1)), ≥)∧[272 + (-1)bso_82] + [3]x1[13]1 ≥ 0)

We simplified constraint (1253) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1254)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13]1)), x3[13]1, x1[13]1)), ≥)∧0 ≥ 0∧0 ≥ 0∧[272 + (-1)bso_82] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14]))) → 6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14]), 6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13]) which results in the following constraint:
(1255)    (x2[14]=x2[13]∧java.lang.Object(LinkedList(46, x3[14]))=x3[13]∧x1[14]=java.lang.Object(LinkedList(45, x1[13])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥))

We simplified constraint (1255) using rule (III) which results in the following new constraint:
(1256)    (6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), java.lang.Object(LinkedList(45, x1[13])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), java.lang.Object(LinkedList(45, x1[13])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[14])), java.lang.Object(LinkedList(46, x3[14])), x1[13])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥))

We simplified constraint (1256) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1257)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧[272 + (-1)bso_82] + [3]x1[13] ≥ 0)

We simplified constraint (1257) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1258)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧[272 + (-1)bso_82] + [3]x1[13] ≥ 0)

We simplified constraint (1258) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1259)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧[272 + (-1)bso_82] + [3]x1[13] ≥ 0)

We simplified constraint (1259) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1260)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧0 ≥ 0∧0 ≥ 0∧[272 + (-1)bso_82] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15]), 6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13]) which results in the following constraint:
(1261)    (java.lang.Object(LinkedList(47, x2[15]))=x2[13]∧x3[15]=x3[13]∧x1[15]=java.lang.Object(LinkedList(45, x1[13])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥))

We simplified constraint (1261) using rule (III) which results in the following new constraint:
(1262)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], java.lang.Object(LinkedList(45, x1[13])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], java.lang.Object(LinkedList(45, x1[13])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, java.lang.Object(LinkedList(47, x2[15])))), x3[15], x1[13])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥))

We simplified constraint (1262) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1263)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧[272 + (-1)bso_82] + [3]x1[13] ≥ 0)

We simplified constraint (1263) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1264)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧[272 + (-1)bso_82] + [3]x1[13] ≥ 0)

We simplified constraint (1264) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1265)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧[272 + (-1)bso_82] + [3]x1[13] ≥ 0)

We simplified constraint (1265) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1266)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧0 ≥ 0∧0 ≥ 0∧[272 + (-1)bso_82] ≥ 0∧[1] ≥ 0)
We consider the chain 6715_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(44, x1[17])), x2[17], x3[17]) → 6432_0_TOPOSTFIX_NULL(x2[17], java.lang.Object(LinkedList(44, x3[17])), x1[17]), 6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13]) which results in the following constraint:
(1267)    (x2[17]=x2[13]∧java.lang.Object(LinkedList(44, x3[17]))=x3[13]∧x1[17]=java.lang.Object(LinkedList(45, x1[13])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥))

We simplified constraint (1267) using rule (III) which results in the following new constraint:
(1268)    (6432_0_TOPOSTFIX_NULL(x2[17], java.lang.Object(LinkedList(44, x3[17])), java.lang.Object(LinkedList(45, x1[13])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[17], java.lang.Object(LinkedList(44, x3[17])), java.lang.Object(LinkedList(45, x1[13])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[17])), java.lang.Object(LinkedList(44, x3[17])), x1[13])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥))

We simplified constraint (1268) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1269)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧[272 + (-1)bso_82] + [3]x1[13] ≥ 0)

We simplified constraint (1269) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1270)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧[272 + (-1)bso_82] + [3]x1[13] ≥ 0)

We simplified constraint (1270) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1271)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧[272 + (-1)bso_82] + [3]x1[13] ≥ 0)

We simplified constraint (1271) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1272)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧0 ≥ 0∧0 ≥ 0∧[272 + (-1)bso_82] ≥ 0∧[1] ≥ 0)
We consider the chain 6725_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(46, x1[18])), x2[18], x3[18]) → 6432_0_TOPOSTFIX_NULL(x2[18], java.lang.Object(LinkedList(46, x3[18])), x1[18]), 6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13]) which results in the following constraint:
(1273)    (x2[18]=x2[13]∧java.lang.Object(LinkedList(46, x3[18]))=x3[13]∧x1[18]=java.lang.Object(LinkedList(45, x1[13])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥))

We simplified constraint (1273) using rule (III) which results in the following new constraint:
(1274)    (6432_0_TOPOSTFIX_NULL(x2[18], java.lang.Object(LinkedList(46, x3[18])), java.lang.Object(LinkedList(45, x1[13])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[18], java.lang.Object(LinkedList(46, x3[18])), java.lang.Object(LinkedList(45, x1[13])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[18])), java.lang.Object(LinkedList(46, x3[18])), x1[13])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥))

We simplified constraint (1274) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1275)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧[272 + (-1)bso_82] + [3]x1[13] ≥ 0)

We simplified constraint (1275) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1276)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧[272 + (-1)bso_82] + [3]x1[13] ≥ 0)

We simplified constraint (1276) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1277)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧[272 + (-1)bso_82] + [3]x1[13] ≥ 0)

We simplified constraint (1277) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1278)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧0 ≥ 0∧0 ≥ 0∧[272 + (-1)bso_82] ≥ 0∧[1] ≥ 0)

For Pair 6432_0_TOPOSTFIX_NULL(x2, x3, java.lang.Object(LinkedList(46, x1))) → 6432_0_TOPOSTFIX_NULL(x2, java.lang.Object(LinkedList(46, x3)), x1) the following chains were created:

We consider the chain 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0]) → 6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0]), 6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14]))) → 6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14]) which results in the following constraint:
(1279)    (x0[0]=x2[14]∧x1[0]=x3[14]∧x2[0]=java.lang.Object(LinkedList(46, x1[14])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14])))≥6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥))

We simplified constraint (1279) using rule (III) which results in the following new constraint:
(1280)    (6432_0_TOPOSTFIX_NULL(x0[0], x1[0], java.lang.Object(LinkedList(46, x1[14])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x0[0], x1[0], java.lang.Object(LinkedList(46, x1[14])))≥6432_0_TOPOSTFIX_NULL(x0[0], java.lang.Object(LinkedList(46, x1[0])), x1[14])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥))

We simplified constraint (1280) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1281)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧[278 + (-1)bso_84] + [3]x1[14] ≥ 0)

We simplified constraint (1281) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1282)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧[278 + (-1)bso_84] + [3]x1[14] ≥ 0)

We simplified constraint (1282) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1283)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧[278 + (-1)bso_84] + [3]x1[14] ≥ 0)

We simplified constraint (1283) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1284)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧0 ≥ 0∧0 ≥ 0∧[278 + (-1)bso_84] ≥ 0∧[1] ≥ 0)
We consider the chain 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]) → 6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]), 6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14]))) → 6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14]) which results in the following constraint:
(1285)    (x0[1]=x2[14]∧java.lang.Object(LinkedList(x1[1], x2[1]))=x3[14]∧x3[1]=java.lang.Object(LinkedList(46, x1[14])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14])))≥6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥))

We simplified constraint (1285) using rule (III) which results in the following new constraint:
(1286)    (6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(46, x1[14])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(46, x1[14])))≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(46, java.lang.Object(LinkedList(x1[1], x2[1])))), x1[14])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥))

We simplified constraint (1286) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1287)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧[278 + (-1)bso_84] + [3]x1[14] ≥ 0)

We simplified constraint (1287) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1288)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧[278 + (-1)bso_84] + [3]x1[14] ≥ 0)

We simplified constraint (1288) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1289)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧[278 + (-1)bso_84] + [3]x1[14] ≥ 0)

We simplified constraint (1289) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1290)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[278 + (-1)bso_84] ≥ 0∧[1] ≥ 0)
We consider the chain 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]), 6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14]))) → 6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14]) which results in the following constraint:
(1291)    (java.lang.Object(LinkedList(42, x1[2]))=x2[14]∧x2[2]=x3[14]∧x3[2]=java.lang.Object(LinkedList(46, x1[14])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14])))≥6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥))

We simplified constraint (1291) using rule (III) which results in the following new constraint:
(1292)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(46, x1[14])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(46, x1[14])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), java.lang.Object(LinkedList(46, x2[2])), x1[14])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥))

We simplified constraint (1292) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1293)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧[278 + (-1)bso_84] + [3]x1[14] ≥ 0)

We simplified constraint (1293) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1294)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧[278 + (-1)bso_84] + [3]x1[14] ≥ 0)

We simplified constraint (1294) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1295)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧[278 + (-1)bso_84] + [3]x1[14] ≥ 0)

We simplified constraint (1295) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1296)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧0 ≥ 0∧0 ≥ 0∧[278 + (-1)bso_84] ≥ 0∧[1] ≥ 0)
We consider the chain 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]), 6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14]))) → 6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14]) which results in the following constraint:
(1297)    (java.lang.Object(LinkedList(43, x1[3]))=x2[14]∧x2[3]=x3[14]∧x3[3]=java.lang.Object(LinkedList(46, x1[14])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14])))≥6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥))

We simplified constraint (1297) using rule (III) which results in the following new constraint:
(1298)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(46, x1[14])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(46, x1[14])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), java.lang.Object(LinkedList(46, x2[3])), x1[14])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥))

We simplified constraint (1298) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1299)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧[278 + (-1)bso_84] + [3]x1[14] ≥ 0)

We simplified constraint (1299) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1300)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧[278 + (-1)bso_84] + [3]x1[14] ≥ 0)

We simplified constraint (1300) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1301)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧[278 + (-1)bso_84] + [3]x1[14] ≥ 0)

We simplified constraint (1301) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1302)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧0 ≥ 0∧0 ≥ 0∧[278 + (-1)bso_84] ≥ 0∧[1] ≥ 0)
We consider the chain 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]), 6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14]))) → 6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14]) which results in the following constraint:
(1303)    (java.lang.Object(LinkedList(45, x1[4]))=x2[14]∧x2[4]=x3[14]∧x3[4]=java.lang.Object(LinkedList(46, x1[14])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14])))≥6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥))

We simplified constraint (1303) using rule (III) which results in the following new constraint:
(1304)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(46, x1[14])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(46, x1[14])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), java.lang.Object(LinkedList(46, x2[4])), x1[14])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥))

We simplified constraint (1304) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1305)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧[278 + (-1)bso_84] + [3]x1[14] ≥ 0)

We simplified constraint (1305) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1306)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧[278 + (-1)bso_84] + [3]x1[14] ≥ 0)

We simplified constraint (1306) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1307)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧[278 + (-1)bso_84] + [3]x1[14] ≥ 0)

We simplified constraint (1307) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1308)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧0 ≥ 0∧0 ≥ 0∧[278 + (-1)bso_84] ≥ 0∧[1] ≥ 0)
We consider the chain 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]), 6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14]))) → 6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14]) which results in the following constraint:
(1309)    (java.lang.Object(LinkedList(47, x1[5]))=x2[14]∧x2[5]=x3[14]∧x3[5]=java.lang.Object(LinkedList(46, x1[14])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14])))≥6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥))

We simplified constraint (1309) using rule (III) which results in the following new constraint:
(1310)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(46, x1[14])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(46, x1[14])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), java.lang.Object(LinkedList(46, x2[5])), x1[14])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥))

We simplified constraint (1310) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1311)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧[278 + (-1)bso_84] + [3]x1[14] ≥ 0)

We simplified constraint (1311) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1312)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧[278 + (-1)bso_84] + [3]x1[14] ≥ 0)

We simplified constraint (1312) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1313)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧[278 + (-1)bso_84] + [3]x1[14] ≥ 0)

We simplified constraint (1313) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1314)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧0 ≥ 0∧0 ≥ 0∧[278 + (-1)bso_84] ≥ 0∧[1] ≥ 0)
We consider the chain COND_6432_0_TOPOSTFIX_NULL(TRUE, x2[7], x3[7], java.lang.Object(LinkedList(x0[7], x1[7]))) → 6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), x1[7]), 6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14]))) → 6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14]) which results in the following constraint:
(1315)    (x2[7]=x2[14]∧java.lang.Object(LinkedList(x0[7], x3[7]))=x3[14]∧x1[7]=java.lang.Object(LinkedList(46, x1[14])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14])))≥6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥))

We simplified constraint (1315) using rule (III) which results in the following new constraint:
(1316)    (6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), java.lang.Object(LinkedList(46, x1[14])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), java.lang.Object(LinkedList(46, x1[14])))≥6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(46, java.lang.Object(LinkedList(x0[7], x3[7])))), x1[14])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥))

We simplified constraint (1316) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1317)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧[278 + (-1)bso_84] + [3]x1[14] ≥ 0)

We simplified constraint (1317) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1318)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧[278 + (-1)bso_84] + [3]x1[14] ≥ 0)

We simplified constraint (1318) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1319)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧[278 + (-1)bso_84] + [3]x1[14] ≥ 0)

We simplified constraint (1319) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1320)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[278 + (-1)bso_84] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8]))) → 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8]), 6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14]))) → 6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14]) which results in the following constraint:
(1321)    (x2[8]=x2[14]∧x3[8]=x3[14]∧x1[8]=java.lang.Object(LinkedList(46, x1[14])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14])))≥6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥))

We simplified constraint (1321) using rule (III) which results in the following new constraint:
(1322)    (6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(46, x1[14])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(46, x1[14])))≥6432_0_TOPOSTFIX_NULL(x2[8], java.lang.Object(LinkedList(46, x3[8])), x1[14])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥))

We simplified constraint (1322) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1323)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧[278 + (-1)bso_84] + [3]x1[14] ≥ 0)

We simplified constraint (1323) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1324)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧[278 + (-1)bso_84] + [3]x1[14] ≥ 0)

We simplified constraint (1324) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1325)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧[278 + (-1)bso_84] + [3]x1[14] ≥ 0)

We simplified constraint (1325) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1326)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧0 ≥ 0∧0 ≥ 0∧[278 + (-1)bso_84] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9]))) → 6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9]), 6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14]))) → 6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14]) which results in the following constraint:
(1327)    (x3[9]=x2[14]∧java.lang.Object(LinkedList(x2[9], x4[9]))=x3[14]∧x1[9]=java.lang.Object(LinkedList(46, x1[14])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14])))≥6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥))

We simplified constraint (1327) using rule (III) which results in the following new constraint:
(1328)    (6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), java.lang.Object(LinkedList(46, x1[14])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), java.lang.Object(LinkedList(46, x1[14])))≥6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(46, java.lang.Object(LinkedList(x2[9], x4[9])))), x1[14])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥))

We simplified constraint (1328) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1329)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧[278 + (-1)bso_84] + [3]x1[14] ≥ 0)

We simplified constraint (1329) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1330)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧[278 + (-1)bso_84] + [3]x1[14] ≥ 0)

We simplified constraint (1330) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1331)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧[278 + (-1)bso_84] + [3]x1[14] ≥ 0)

We simplified constraint (1331) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1332)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[278 + (-1)bso_84] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10]), 6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14]))) → 6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14]) which results in the following constraint:
(1333)    (java.lang.Object(LinkedList(42, x2[10]))=x2[14]∧x3[10]=x3[14]∧x1[10]=java.lang.Object(LinkedList(46, x1[14])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14])))≥6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥))

We simplified constraint (1333) using rule (III) which results in the following new constraint:
(1334)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], java.lang.Object(LinkedList(46, x1[14])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], java.lang.Object(LinkedList(46, x1[14])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), java.lang.Object(LinkedList(46, x3[10])), x1[14])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥))

We simplified constraint (1334) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1335)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧[278 + (-1)bso_84] + [3]x1[14] ≥ 0)

We simplified constraint (1335) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1336)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧[278 + (-1)bso_84] + [3]x1[14] ≥ 0)

We simplified constraint (1336) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1337)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧[278 + (-1)bso_84] + [3]x1[14] ≥ 0)

We simplified constraint (1337) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1338)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧0 ≥ 0∧0 ≥ 0∧[278 + (-1)bso_84] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11]), 6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14]))) → 6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14]) which results in the following constraint:
(1339)    (java.lang.Object(LinkedList(43, x2[11]))=x2[14]∧x3[11]=x3[14]∧x1[11]=java.lang.Object(LinkedList(46, x1[14])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14])))≥6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥))

We simplified constraint (1339) using rule (III) which results in the following new constraint:
(1340)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], java.lang.Object(LinkedList(46, x1[14])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], java.lang.Object(LinkedList(46, x1[14])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), java.lang.Object(LinkedList(46, x3[11])), x1[14])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥))

We simplified constraint (1340) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1341)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧[278 + (-1)bso_84] + [3]x1[14] ≥ 0)

We simplified constraint (1341) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1342)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧[278 + (-1)bso_84] + [3]x1[14] ≥ 0)

We simplified constraint (1342) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1343)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧[278 + (-1)bso_84] + [3]x1[14] ≥ 0)

We simplified constraint (1343) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1344)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧0 ≥ 0∧0 ≥ 0∧[278 + (-1)bso_84] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12]))) → 6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12]), 6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14]))) → 6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14]) which results in the following constraint:
(1345)    (x2[12]=x2[14]∧java.lang.Object(LinkedList(44, x3[12]))=x3[14]∧x1[12]=java.lang.Object(LinkedList(46, x1[14])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14])))≥6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥))

We simplified constraint (1345) using rule (III) which results in the following new constraint:
(1346)    (6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), java.lang.Object(LinkedList(46, x1[14])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), java.lang.Object(LinkedList(46, x1[14])))≥6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(46, java.lang.Object(LinkedList(44, x3[12])))), x1[14])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥))

We simplified constraint (1346) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1347)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧[278 + (-1)bso_84] + [3]x1[14] ≥ 0)

We simplified constraint (1347) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1348)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧[278 + (-1)bso_84] + [3]x1[14] ≥ 0)

We simplified constraint (1348) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1349)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧[278 + (-1)bso_84] + [3]x1[14] ≥ 0)

We simplified constraint (1349) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1350)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧0 ≥ 0∧0 ≥ 0∧[278 + (-1)bso_84] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13]), 6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14]))) → 6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14]) which results in the following constraint:
(1351)    (java.lang.Object(LinkedList(45, x2[13]))=x2[14]∧x3[13]=x3[14]∧x1[13]=java.lang.Object(LinkedList(46, x1[14])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14])))≥6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥))

We simplified constraint (1351) using rule (III) which results in the following new constraint:
(1352)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], java.lang.Object(LinkedList(46, x1[14])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], java.lang.Object(LinkedList(46, x1[14])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), java.lang.Object(LinkedList(46, x3[13])), x1[14])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥))

We simplified constraint (1352) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1353)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧[278 + (-1)bso_84] + [3]x1[14] ≥ 0)

We simplified constraint (1353) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1354)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧[278 + (-1)bso_84] + [3]x1[14] ≥ 0)

We simplified constraint (1354) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1355)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧[278 + (-1)bso_84] + [3]x1[14] ≥ 0)

We simplified constraint (1355) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1356)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧0 ≥ 0∧0 ≥ 0∧[278 + (-1)bso_84] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14]))) → 6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14]), 6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14]))) → 6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14]) which results in the following constraint:
(1357)    (x2[14]=x2[14]1∧java.lang.Object(LinkedList(46, x3[14]))=x3[14]1∧x1[14]=java.lang.Object(LinkedList(46, x1[14]1)) ⇒ 6432_0_TOPOSTFIX_NULL(x2[14]1, x3[14]1, java.lang.Object(LinkedList(46, x1[14]1)))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[14]1, x3[14]1, java.lang.Object(LinkedList(46, x1[14]1)))≥6432_0_TOPOSTFIX_NULL(x2[14]1, java.lang.Object(LinkedList(46, x3[14]1)), x1[14]1)∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14]1, java.lang.Object(LinkedList(46, x3[14]1)), x1[14]1)), ≥))

We simplified constraint (1357) using rule (III) which results in the following new constraint:
(1358)    (6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), java.lang.Object(LinkedList(46, x1[14]1)))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), java.lang.Object(LinkedList(46, x1[14]1)))≥6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, java.lang.Object(LinkedList(46, x3[14])))), x1[14]1)∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14]1, java.lang.Object(LinkedList(46, x3[14]1)), x1[14]1)), ≥))

We simplified constraint (1358) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1359)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14]1, java.lang.Object(LinkedList(46, x3[14]1)), x1[14]1)), ≥)∧[278 + (-1)bso_84] + [3]x1[14]1 ≥ 0)

We simplified constraint (1359) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1360)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14]1, java.lang.Object(LinkedList(46, x3[14]1)), x1[14]1)), ≥)∧[278 + (-1)bso_84] + [3]x1[14]1 ≥ 0)

We simplified constraint (1360) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1361)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14]1, java.lang.Object(LinkedList(46, x3[14]1)), x1[14]1)), ≥)∧[278 + (-1)bso_84] + [3]x1[14]1 ≥ 0)

We simplified constraint (1361) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1362)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14]1, java.lang.Object(LinkedList(46, x3[14]1)), x1[14]1)), ≥)∧0 ≥ 0∧0 ≥ 0∧[278 + (-1)bso_84] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15]), 6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14]))) → 6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14]) which results in the following constraint:
(1363)    (java.lang.Object(LinkedList(47, x2[15]))=x2[14]∧x3[15]=x3[14]∧x1[15]=java.lang.Object(LinkedList(46, x1[14])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14])))≥6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥))

We simplified constraint (1363) using rule (III) which results in the following new constraint:
(1364)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], java.lang.Object(LinkedList(46, x1[14])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], java.lang.Object(LinkedList(46, x1[14])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), java.lang.Object(LinkedList(46, x3[15])), x1[14])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥))

We simplified constraint (1364) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1365)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧[278 + (-1)bso_84] + [3]x1[14] ≥ 0)

We simplified constraint (1365) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1366)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧[278 + (-1)bso_84] + [3]x1[14] ≥ 0)

We simplified constraint (1366) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1367)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧[278 + (-1)bso_84] + [3]x1[14] ≥ 0)

We simplified constraint (1367) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1368)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧0 ≥ 0∧0 ≥ 0∧[278 + (-1)bso_84] ≥ 0∧[1] ≥ 0)
We consider the chain 6715_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(44, x1[17])), x2[17], x3[17]) → 6432_0_TOPOSTFIX_NULL(x2[17], java.lang.Object(LinkedList(44, x3[17])), x1[17]), 6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14]))) → 6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14]) which results in the following constraint:
(1369)    (x2[17]=x2[14]∧java.lang.Object(LinkedList(44, x3[17]))=x3[14]∧x1[17]=java.lang.Object(LinkedList(46, x1[14])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14])))≥6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥))

We simplified constraint (1369) using rule (III) which results in the following new constraint:
(1370)    (6432_0_TOPOSTFIX_NULL(x2[17], java.lang.Object(LinkedList(44, x3[17])), java.lang.Object(LinkedList(46, x1[14])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[17], java.lang.Object(LinkedList(44, x3[17])), java.lang.Object(LinkedList(46, x1[14])))≥6432_0_TOPOSTFIX_NULL(x2[17], java.lang.Object(LinkedList(46, java.lang.Object(LinkedList(44, x3[17])))), x1[14])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥))

We simplified constraint (1370) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1371)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧[278 + (-1)bso_84] + [3]x1[14] ≥ 0)

We simplified constraint (1371) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1372)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧[278 + (-1)bso_84] + [3]x1[14] ≥ 0)

We simplified constraint (1372) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1373)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧[278 + (-1)bso_84] + [3]x1[14] ≥ 0)

We simplified constraint (1373) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1374)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧0 ≥ 0∧0 ≥ 0∧[278 + (-1)bso_84] ≥ 0∧[1] ≥ 0)
We consider the chain 6725_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(46, x1[18])), x2[18], x3[18]) → 6432_0_TOPOSTFIX_NULL(x2[18], java.lang.Object(LinkedList(46, x3[18])), x1[18]), 6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14]))) → 6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14]) which results in the following constraint:
(1375)    (x2[18]=x2[14]∧java.lang.Object(LinkedList(46, x3[18]))=x3[14]∧x1[18]=java.lang.Object(LinkedList(46, x1[14])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14])))≥6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥))

We simplified constraint (1375) using rule (III) which results in the following new constraint:
(1376)    (6432_0_TOPOSTFIX_NULL(x2[18], java.lang.Object(LinkedList(46, x3[18])), java.lang.Object(LinkedList(46, x1[14])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[18], java.lang.Object(LinkedList(46, x3[18])), java.lang.Object(LinkedList(46, x1[14])))≥6432_0_TOPOSTFIX_NULL(x2[18], java.lang.Object(LinkedList(46, java.lang.Object(LinkedList(46, x3[18])))), x1[14])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥))

We simplified constraint (1376) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1377)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧[278 + (-1)bso_84] + [3]x1[14] ≥ 0)

We simplified constraint (1377) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1378)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧[278 + (-1)bso_84] + [3]x1[14] ≥ 0)

We simplified constraint (1378) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1379)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧[278 + (-1)bso_84] + [3]x1[14] ≥ 0)

We simplified constraint (1379) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1380)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧0 ≥ 0∧0 ≥ 0∧[278 + (-1)bso_84] ≥ 0∧[1] ≥ 0)

For Pair 6432_0_TOPOSTFIX_NULL(x2, x3, java.lang.Object(LinkedList(47, x1))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2)), x3, x1) the following chains were created:

We consider the chain 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0]) → 6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0]), 6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15]) which results in the following constraint:
(1381)    (x0[0]=x2[15]∧x1[0]=x3[15]∧x2[0]=java.lang.Object(LinkedList(47, x1[15])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥))

We simplified constraint (1381) using rule (III) which results in the following new constraint:
(1382)    (6432_0_TOPOSTFIX_NULL(x0[0], x1[0], java.lang.Object(LinkedList(47, x1[15])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x0[0], x1[0], java.lang.Object(LinkedList(47, x1[15])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x0[0])), x1[0], x1[15])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥))

We simplified constraint (1382) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1383)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧[284 + (-1)bso_86] + [3]x1[15] ≥ 0)

We simplified constraint (1383) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1384)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧[284 + (-1)bso_86] + [3]x1[15] ≥ 0)

We simplified constraint (1384) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1385)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧[284 + (-1)bso_86] + [3]x1[15] ≥ 0)

We simplified constraint (1385) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1386)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧0 ≥ 0∧0 ≥ 0∧[284 + (-1)bso_86] ≥ 0∧[1] ≥ 0)
We consider the chain 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]) → 6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]), 6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15]) which results in the following constraint:
(1387)    (x0[1]=x2[15]∧java.lang.Object(LinkedList(x1[1], x2[1]))=x3[15]∧x3[1]=java.lang.Object(LinkedList(47, x1[15])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥))

We simplified constraint (1387) using rule (III) which results in the following new constraint:
(1388)    (6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(47, x1[15])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(47, x1[15])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x0[1])), java.lang.Object(LinkedList(x1[1], x2[1])), x1[15])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥))

We simplified constraint (1388) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1389)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧[284 + (-1)bso_86] + [3]x1[15] ≥ 0)

We simplified constraint (1389) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1390)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧[284 + (-1)bso_86] + [3]x1[15] ≥ 0)

We simplified constraint (1390) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1391)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧[284 + (-1)bso_86] + [3]x1[15] ≥ 0)

We simplified constraint (1391) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1392)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[284 + (-1)bso_86] ≥ 0∧[1] ≥ 0)
We consider the chain 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]), 6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15]) which results in the following constraint:
(1393)    (java.lang.Object(LinkedList(42, x1[2]))=x2[15]∧x2[2]=x3[15]∧x3[2]=java.lang.Object(LinkedList(47, x1[15])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥))

We simplified constraint (1393) using rule (III) which results in the following new constraint:
(1394)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(47, x1[15])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(47, x1[15])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, java.lang.Object(LinkedList(42, x1[2])))), x2[2], x1[15])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥))

We simplified constraint (1394) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1395)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧[284 + (-1)bso_86] + [3]x1[15] ≥ 0)

We simplified constraint (1395) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1396)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧[284 + (-1)bso_86] + [3]x1[15] ≥ 0)

We simplified constraint (1396) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1397)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧[284 + (-1)bso_86] + [3]x1[15] ≥ 0)

We simplified constraint (1397) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1398)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧0 ≥ 0∧0 ≥ 0∧[284 + (-1)bso_86] ≥ 0∧[1] ≥ 0)
We consider the chain 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]), 6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15]) which results in the following constraint:
(1399)    (java.lang.Object(LinkedList(43, x1[3]))=x2[15]∧x2[3]=x3[15]∧x3[3]=java.lang.Object(LinkedList(47, x1[15])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥))

We simplified constraint (1399) using rule (III) which results in the following new constraint:
(1400)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(47, x1[15])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(47, x1[15])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, java.lang.Object(LinkedList(43, x1[3])))), x2[3], x1[15])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥))

We simplified constraint (1400) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1401)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧[284 + (-1)bso_86] + [3]x1[15] ≥ 0)

We simplified constraint (1401) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1402)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧[284 + (-1)bso_86] + [3]x1[15] ≥ 0)

We simplified constraint (1402) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1403)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧[284 + (-1)bso_86] + [3]x1[15] ≥ 0)

We simplified constraint (1403) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1404)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧0 ≥ 0∧0 ≥ 0∧[284 + (-1)bso_86] ≥ 0∧[1] ≥ 0)
We consider the chain 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]), 6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15]) which results in the following constraint:
(1405)    (java.lang.Object(LinkedList(45, x1[4]))=x2[15]∧x2[4]=x3[15]∧x3[4]=java.lang.Object(LinkedList(47, x1[15])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥))

We simplified constraint (1405) using rule (III) which results in the following new constraint:
(1406)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(47, x1[15])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(47, x1[15])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, java.lang.Object(LinkedList(45, x1[4])))), x2[4], x1[15])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥))

We simplified constraint (1406) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1407)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧[284 + (-1)bso_86] + [3]x1[15] ≥ 0)

We simplified constraint (1407) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1408)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧[284 + (-1)bso_86] + [3]x1[15] ≥ 0)

We simplified constraint (1408) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1409)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧[284 + (-1)bso_86] + [3]x1[15] ≥ 0)

We simplified constraint (1409) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1410)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧0 ≥ 0∧0 ≥ 0∧[284 + (-1)bso_86] ≥ 0∧[1] ≥ 0)
We consider the chain 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]), 6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15]) which results in the following constraint:
(1411)    (java.lang.Object(LinkedList(47, x1[5]))=x2[15]∧x2[5]=x3[15]∧x3[5]=java.lang.Object(LinkedList(47, x1[15])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥))

We simplified constraint (1411) using rule (III) which results in the following new constraint:
(1412)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(47, x1[15])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(47, x1[15])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, java.lang.Object(LinkedList(47, x1[5])))), x2[5], x1[15])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥))

We simplified constraint (1412) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1413)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧[284 + (-1)bso_86] + [3]x1[15] ≥ 0)

We simplified constraint (1413) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1414)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧[284 + (-1)bso_86] + [3]x1[15] ≥ 0)

We simplified constraint (1414) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1415)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧[284 + (-1)bso_86] + [3]x1[15] ≥ 0)

We simplified constraint (1415) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1416)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧0 ≥ 0∧0 ≥ 0∧[284 + (-1)bso_86] ≥ 0∧[1] ≥ 0)
We consider the chain COND_6432_0_TOPOSTFIX_NULL(TRUE, x2[7], x3[7], java.lang.Object(LinkedList(x0[7], x1[7]))) → 6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), x1[7]), 6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15]) which results in the following constraint:
(1417)    (x2[7]=x2[15]∧java.lang.Object(LinkedList(x0[7], x3[7]))=x3[15]∧x1[7]=java.lang.Object(LinkedList(47, x1[15])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥))

We simplified constraint (1417) using rule (III) which results in the following new constraint:
(1418)    (6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), java.lang.Object(LinkedList(47, x1[15])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), java.lang.Object(LinkedList(47, x1[15])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[7])), java.lang.Object(LinkedList(x0[7], x3[7])), x1[15])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥))

We simplified constraint (1418) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1419)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧[284 + (-1)bso_86] + [3]x1[15] ≥ 0)

We simplified constraint (1419) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1420)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧[284 + (-1)bso_86] + [3]x1[15] ≥ 0)

We simplified constraint (1420) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1421)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧[284 + (-1)bso_86] + [3]x1[15] ≥ 0)

We simplified constraint (1421) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1422)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[284 + (-1)bso_86] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8]))) → 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8]), 6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15]) which results in the following constraint:
(1423)    (x2[8]=x2[15]∧x3[8]=x3[15]∧x1[8]=java.lang.Object(LinkedList(47, x1[15])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥))

We simplified constraint (1423) using rule (III) which results in the following new constraint:
(1424)    (6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(47, x1[15])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(47, x1[15])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[8])), x3[8], x1[15])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥))

We simplified constraint (1424) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1425)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧[284 + (-1)bso_86] + [3]x1[15] ≥ 0)

We simplified constraint (1425) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1426)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧[284 + (-1)bso_86] + [3]x1[15] ≥ 0)

We simplified constraint (1426) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1427)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧[284 + (-1)bso_86] + [3]x1[15] ≥ 0)

We simplified constraint (1427) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1428)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧0 ≥ 0∧0 ≥ 0∧[284 + (-1)bso_86] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9]))) → 6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9]), 6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15]) which results in the following constraint:
(1429)    (x3[9]=x2[15]∧java.lang.Object(LinkedList(x2[9], x4[9]))=x3[15]∧x1[9]=java.lang.Object(LinkedList(47, x1[15])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥))

We simplified constraint (1429) using rule (III) which results in the following new constraint:
(1430)    (6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), java.lang.Object(LinkedList(47, x1[15])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), java.lang.Object(LinkedList(47, x1[15])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x3[9])), java.lang.Object(LinkedList(x2[9], x4[9])), x1[15])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥))

We simplified constraint (1430) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1431)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧[284 + (-1)bso_86] + [3]x1[15] ≥ 0)

We simplified constraint (1431) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1432)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧[284 + (-1)bso_86] + [3]x1[15] ≥ 0)

We simplified constraint (1432) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1433)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧[284 + (-1)bso_86] + [3]x1[15] ≥ 0)

We simplified constraint (1433) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1434)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[284 + (-1)bso_86] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10]), 6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15]) which results in the following constraint:
(1435)    (java.lang.Object(LinkedList(42, x2[10]))=x2[15]∧x3[10]=x3[15]∧x1[10]=java.lang.Object(LinkedList(47, x1[15])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥))

We simplified constraint (1435) using rule (III) which results in the following new constraint:
(1436)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], java.lang.Object(LinkedList(47, x1[15])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], java.lang.Object(LinkedList(47, x1[15])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, java.lang.Object(LinkedList(42, x2[10])))), x3[10], x1[15])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥))

We simplified constraint (1436) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1437)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧[284 + (-1)bso_86] + [3]x1[15] ≥ 0)

We simplified constraint (1437) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1438)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧[284 + (-1)bso_86] + [3]x1[15] ≥ 0)

We simplified constraint (1438) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1439)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧[284 + (-1)bso_86] + [3]x1[15] ≥ 0)

We simplified constraint (1439) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1440)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧0 ≥ 0∧0 ≥ 0∧[284 + (-1)bso_86] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11]), 6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15]) which results in the following constraint:
(1441)    (java.lang.Object(LinkedList(43, x2[11]))=x2[15]∧x3[11]=x3[15]∧x1[11]=java.lang.Object(LinkedList(47, x1[15])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥))

We simplified constraint (1441) using rule (III) which results in the following new constraint:
(1442)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], java.lang.Object(LinkedList(47, x1[15])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], java.lang.Object(LinkedList(47, x1[15])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, java.lang.Object(LinkedList(43, x2[11])))), x3[11], x1[15])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥))

We simplified constraint (1442) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1443)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧[284 + (-1)bso_86] + [3]x1[15] ≥ 0)

We simplified constraint (1443) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1444)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧[284 + (-1)bso_86] + [3]x1[15] ≥ 0)

We simplified constraint (1444) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1445)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧[284 + (-1)bso_86] + [3]x1[15] ≥ 0)

We simplified constraint (1445) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1446)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧0 ≥ 0∧0 ≥ 0∧[284 + (-1)bso_86] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12]))) → 6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12]), 6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15]) which results in the following constraint:
(1447)    (x2[12]=x2[15]∧java.lang.Object(LinkedList(44, x3[12]))=x3[15]∧x1[12]=java.lang.Object(LinkedList(47, x1[15])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥))

We simplified constraint (1447) using rule (III) which results in the following new constraint:
(1448)    (6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), java.lang.Object(LinkedList(47, x1[15])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), java.lang.Object(LinkedList(47, x1[15])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[12])), java.lang.Object(LinkedList(44, x3[12])), x1[15])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥))

We simplified constraint (1448) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1449)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧[284 + (-1)bso_86] + [3]x1[15] ≥ 0)

We simplified constraint (1449) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1450)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧[284 + (-1)bso_86] + [3]x1[15] ≥ 0)

We simplified constraint (1450) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1451)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧[284 + (-1)bso_86] + [3]x1[15] ≥ 0)

We simplified constraint (1451) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1452)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧0 ≥ 0∧0 ≥ 0∧[284 + (-1)bso_86] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13]), 6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15]) which results in the following constraint:
(1453)    (java.lang.Object(LinkedList(45, x2[13]))=x2[15]∧x3[13]=x3[15]∧x1[13]=java.lang.Object(LinkedList(47, x1[15])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥))

We simplified constraint (1453) using rule (III) which results in the following new constraint:
(1454)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], java.lang.Object(LinkedList(47, x1[15])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], java.lang.Object(LinkedList(47, x1[15])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, java.lang.Object(LinkedList(45, x2[13])))), x3[13], x1[15])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥))

We simplified constraint (1454) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1455)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧[284 + (-1)bso_86] + [3]x1[15] ≥ 0)

We simplified constraint (1455) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1456)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧[284 + (-1)bso_86] + [3]x1[15] ≥ 0)

We simplified constraint (1456) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1457)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧[284 + (-1)bso_86] + [3]x1[15] ≥ 0)

We simplified constraint (1457) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1458)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧0 ≥ 0∧0 ≥ 0∧[284 + (-1)bso_86] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14]))) → 6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14]), 6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15]) which results in the following constraint:
(1459)    (x2[14]=x2[15]∧java.lang.Object(LinkedList(46, x3[14]))=x3[15]∧x1[14]=java.lang.Object(LinkedList(47, x1[15])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥))

We simplified constraint (1459) using rule (III) which results in the following new constraint:
(1460)    (6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), java.lang.Object(LinkedList(47, x1[15])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), java.lang.Object(LinkedList(47, x1[15])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[14])), java.lang.Object(LinkedList(46, x3[14])), x1[15])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥))

We simplified constraint (1460) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1461)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧[284 + (-1)bso_86] + [3]x1[15] ≥ 0)

We simplified constraint (1461) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1462)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧[284 + (-1)bso_86] + [3]x1[15] ≥ 0)

We simplified constraint (1462) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1463)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧[284 + (-1)bso_86] + [3]x1[15] ≥ 0)

We simplified constraint (1463) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1464)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧0 ≥ 0∧0 ≥ 0∧[284 + (-1)bso_86] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15]), 6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15]) which results in the following constraint:
(1465)    (java.lang.Object(LinkedList(47, x2[15]))=x2[15]1∧x3[15]=x3[15]1∧x1[15]=java.lang.Object(LinkedList(47, x1[15]1)) ⇒ 6432_0_TOPOSTFIX_NULL(x2[15]1, x3[15]1, java.lang.Object(LinkedList(47, x1[15]1)))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[15]1, x3[15]1, java.lang.Object(LinkedList(47, x1[15]1)))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15]1)), x3[15]1, x1[15]1)∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15]1)), x3[15]1, x1[15]1)), ≥))

We simplified constraint (1465) using rule (III) which results in the following new constraint:
(1466)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], java.lang.Object(LinkedList(47, x1[15]1)))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], java.lang.Object(LinkedList(47, x1[15]1)))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, java.lang.Object(LinkedList(47, x2[15])))), x3[15], x1[15]1)∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15]1)), x3[15]1, x1[15]1)), ≥))

We simplified constraint (1466) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1467)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15]1)), x3[15]1, x1[15]1)), ≥)∧[284 + (-1)bso_86] + [3]x1[15]1 ≥ 0)

We simplified constraint (1467) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1468)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15]1)), x3[15]1, x1[15]1)), ≥)∧[284 + (-1)bso_86] + [3]x1[15]1 ≥ 0)

We simplified constraint (1468) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1469)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15]1)), x3[15]1, x1[15]1)), ≥)∧[284 + (-1)bso_86] + [3]x1[15]1 ≥ 0)

We simplified constraint (1469) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1470)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15]1)), x3[15]1, x1[15]1)), ≥)∧0 ≥ 0∧0 ≥ 0∧[284 + (-1)bso_86] ≥ 0∧[1] ≥ 0)
We consider the chain 6715_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(44, x1[17])), x2[17], x3[17]) → 6432_0_TOPOSTFIX_NULL(x2[17], java.lang.Object(LinkedList(44, x3[17])), x1[17]), 6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15]) which results in the following constraint:
(1471)    (x2[17]=x2[15]∧java.lang.Object(LinkedList(44, x3[17]))=x3[15]∧x1[17]=java.lang.Object(LinkedList(47, x1[15])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥))

We simplified constraint (1471) using rule (III) which results in the following new constraint:
(1472)    (6432_0_TOPOSTFIX_NULL(x2[17], java.lang.Object(LinkedList(44, x3[17])), java.lang.Object(LinkedList(47, x1[15])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[17], java.lang.Object(LinkedList(44, x3[17])), java.lang.Object(LinkedList(47, x1[15])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[17])), java.lang.Object(LinkedList(44, x3[17])), x1[15])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥))

We simplified constraint (1472) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1473)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧[284 + (-1)bso_86] + [3]x1[15] ≥ 0)

We simplified constraint (1473) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1474)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧[284 + (-1)bso_86] + [3]x1[15] ≥ 0)

We simplified constraint (1474) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1475)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧[284 + (-1)bso_86] + [3]x1[15] ≥ 0)

We simplified constraint (1475) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1476)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧0 ≥ 0∧0 ≥ 0∧[284 + (-1)bso_86] ≥ 0∧[1] ≥ 0)
We consider the chain 6725_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(46, x1[18])), x2[18], x3[18]) → 6432_0_TOPOSTFIX_NULL(x2[18], java.lang.Object(LinkedList(46, x3[18])), x1[18]), 6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15]) which results in the following constraint:
(1477)    (x2[18]=x2[15]∧java.lang.Object(LinkedList(46, x3[18]))=x3[15]∧x1[18]=java.lang.Object(LinkedList(47, x1[15])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥))

We simplified constraint (1477) using rule (III) which results in the following new constraint:
(1478)    (6432_0_TOPOSTFIX_NULL(x2[18], java.lang.Object(LinkedList(46, x3[18])), java.lang.Object(LinkedList(47, x1[15])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[18], java.lang.Object(LinkedList(46, x3[18])), java.lang.Object(LinkedList(47, x1[15])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[18])), java.lang.Object(LinkedList(46, x3[18])), x1[15])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥))

We simplified constraint (1478) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1479)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧[284 + (-1)bso_86] + [3]x1[15] ≥ 0)

We simplified constraint (1479) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1480)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧[284 + (-1)bso_86] + [3]x1[15] ≥ 0)

We simplified constraint (1480) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1481)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧[284 + (-1)bso_86] + [3]x1[15] ≥ 0)

We simplified constraint (1481) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1482)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧0 ≥ 0∧0 ≥ 0∧[284 + (-1)bso_86] ≥ 0∧[1] ≥ 0)

For Pair 6432_0_TOPOSTFIX_NULL(x2, x3, java.lang.Object(LinkedList(x0, x1))) → COND_6432_0_TOPOSTFIX_NULL(>(x0, 47), x2, x3, java.lang.Object(LinkedList(x0, x1))) the following chains were created:

We consider the chain 6432_0_TOPOSTFIX_NULL(x2[16], x3[16], java.lang.Object(LinkedList(x0[16], x1[16]))) → COND_6432_0_TOPOSTFIX_NULL(>(x0[16], 47), x2[16], x3[16], java.lang.Object(LinkedList(x0[16], x1[16]))), COND_6432_0_TOPOSTFIX_NULL(TRUE, x2[7], x3[7], java.lang.Object(LinkedList(x0[7], x1[7]))) → 6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), x1[7]) which results in the following constraint:
(1483)    (>(x0[16], 47)=TRUE∧x2[16]=x2[7]∧x3[16]=x3[7]∧java.lang.Object(LinkedList(x0[16], x1[16]))=java.lang.Object(LinkedList(x0[7], x1[7])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[16], x3[16], java.lang.Object(LinkedList(x0[16], x1[16])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[16], x3[16], java.lang.Object(LinkedList(x0[16], x1[16])))≥COND_6432_0_TOPOSTFIX_NULL(>(x0[16], 47), x2[16], x3[16], java.lang.Object(LinkedList(x0[16], x1[16])))∧(U^Increasing(COND_6432_0_TOPOSTFIX_NULL(>(x0[16], 47), x2[16], x3[16], java.lang.Object(LinkedList(x0[16], x1[16])))), ≥))

We simplified constraint (1483) using rules (I), (II), (IV) which results in the following new constraint:
(1484)    (>(x0[16], 47)=TRUE ⇒ 6432_0_TOPOSTFIX_NULL(x2[16], x3[16], java.lang.Object(LinkedList(x0[16], x1[16])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[16], x3[16], java.lang.Object(LinkedList(x0[16], x1[16])))≥COND_6432_0_TOPOSTFIX_NULL(>(x0[16], 47), x2[16], x3[16], java.lang.Object(LinkedList(x0[16], x1[16])))∧(U^Increasing(COND_6432_0_TOPOSTFIX_NULL(>(x0[16], 47), x2[16], x3[16], java.lang.Object(LinkedList(x0[16], x1[16])))), ≥))

We simplified constraint (1484) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1485)    (0 ≥ 0 ⇒ (U^Increasing(COND_6432_0_TOPOSTFIX_NULL(>(x0[16], 47), x2[16], x3[16], java.lang.Object(LinkedList(x0[16], x1[16])))), ≥)∧[bni_87 + (-1)Bound*bni_87] + [(4)bni_87]x1[16] + [(6)bni_87]x0[16] ≥ 0∧[(-1)bso_88] ≥ 0)

We simplified constraint (1485) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1486)    (0 ≥ 0 ⇒ (U^Increasing(COND_6432_0_TOPOSTFIX_NULL(>(x0[16], 47), x2[16], x3[16], java.lang.Object(LinkedList(x0[16], x1[16])))), ≥)∧[bni_87 + (-1)Bound*bni_87] + [(4)bni_87]x1[16] + [(6)bni_87]x0[16] ≥ 0∧[(-1)bso_88] ≥ 0)

We simplified constraint (1486) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1487)    (0 ≥ 0 ⇒ (U^Increasing(COND_6432_0_TOPOSTFIX_NULL(>(x0[16], 47), x2[16], x3[16], java.lang.Object(LinkedList(x0[16], x1[16])))), ≥)∧[bni_87 + (-1)Bound*bni_87] + [(4)bni_87]x1[16] + [(6)bni_87]x0[16] ≥ 0∧[(-1)bso_88] ≥ 0)

We simplified constraint (1487) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(1488)    (0 ≥ 0 ⇒ (U^Increasing(COND_6432_0_TOPOSTFIX_NULL(>(x0[16], 47), x2[16], x3[16], java.lang.Object(LinkedList(x0[16], x1[16])))), ≥)∧[(4)bni_87] ≥ 0∧[(6)bni_87] ≥ 0∧0 ≥ 0∧0 ≥ 0∧[bni_87 + (-1)Bound*bni_87] ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_88] ≥ 0)

For Pair 6715_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(44, x1)), x2, x3) → 6432_0_TOPOSTFIX_NULL(x2, java.lang.Object(LinkedList(44, x3)), x1) the following chains were created:

We consider the chain 6432_0_TOPOSTFIX_NULL(x2[19], x3[19], java.lang.Object(LinkedList(44, x1[19]))) → 6715_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(44, x1[19])), x2[19], x3[19]), 6715_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(44, x1[17])), x2[17], x3[17]) → 6432_0_TOPOSTFIX_NULL(x2[17], java.lang.Object(LinkedList(44, x3[17])), x1[17]) which results in the following constraint:
(1489)    (java.lang.Object(LinkedList(44, x1[19]))=java.lang.Object(LinkedList(44, x1[17]))∧x2[19]=x2[17]∧x3[19]=x3[17] ⇒ 6715_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(44, x1[17])), x2[17], x3[17])≥NonInfC∧6715_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(44, x1[17])), x2[17], x3[17])≥6432_0_TOPOSTFIX_NULL(x2[17], java.lang.Object(LinkedList(44, x3[17])), x1[17])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[17], java.lang.Object(LinkedList(44, x3[17])), x1[17])), ≥))

We simplified constraint (1489) using rules (I), (II), (III), (DELETE_TRIVIAL_REDUCESTO) which results in the following new constraint:
(1490)    (6715_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(44, x1[19])), x2[19], x3[19])≥NonInfC∧6715_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(44, x1[19])), x2[19], x3[19])≥6432_0_TOPOSTFIX_NULL(x2[19], java.lang.Object(LinkedList(44, x3[19])), x1[19])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[17], java.lang.Object(LinkedList(44, x3[17])), x1[17])), ≥))

We simplified constraint (1490) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1491)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[17], java.lang.Object(LinkedList(44, x3[17])), x1[17])), ≥)∧[266 + (-1)bso_90] + [3]x1[19] ≥ 0)

We simplified constraint (1491) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1492)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[17], java.lang.Object(LinkedList(44, x3[17])), x1[17])), ≥)∧[266 + (-1)bso_90] + [3]x1[19] ≥ 0)

We simplified constraint (1492) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1493)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[17], java.lang.Object(LinkedList(44, x3[17])), x1[17])), ≥)∧[266 + (-1)bso_90] + [3]x1[19] ≥ 0)

We simplified constraint (1493) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1494)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[17], java.lang.Object(LinkedList(44, x3[17])), x1[17])), ≥)∧0 ≥ 0∧0 ≥ 0∧[266 + (-1)bso_90] ≥ 0∧[1] ≥ 0)

For Pair 6725_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(46, x1)), x2, x3) → 6432_0_TOPOSTFIX_NULL(x2, java.lang.Object(LinkedList(46, x3)), x1) the following chains were created:

We consider the chain 6432_0_TOPOSTFIX_NULL(x2[20], x3[20], java.lang.Object(LinkedList(46, x1[20]))) → 6725_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(46, x1[20])), x2[20], x3[20]), 6725_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(46, x1[18])), x2[18], x3[18]) → 6432_0_TOPOSTFIX_NULL(x2[18], java.lang.Object(LinkedList(46, x3[18])), x1[18]) which results in the following constraint:
(1495)    (java.lang.Object(LinkedList(46, x1[20]))=java.lang.Object(LinkedList(46, x1[18]))∧x2[20]=x2[18]∧x3[20]=x3[18] ⇒ 6725_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(46, x1[18])), x2[18], x3[18])≥NonInfC∧6725_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(46, x1[18])), x2[18], x3[18])≥6432_0_TOPOSTFIX_NULL(x2[18], java.lang.Object(LinkedList(46, x3[18])), x1[18])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[18], java.lang.Object(LinkedList(46, x3[18])), x1[18])), ≥))

We simplified constraint (1495) using rules (I), (II), (III), (DELETE_TRIVIAL_REDUCESTO) which results in the following new constraint:
(1496)    (6725_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(46, x1[20])), x2[20], x3[20])≥NonInfC∧6725_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(46, x1[20])), x2[20], x3[20])≥6432_0_TOPOSTFIX_NULL(x2[20], java.lang.Object(LinkedList(46, x3[20])), x1[20])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[18], java.lang.Object(LinkedList(46, x3[18])), x1[18])), ≥))

We simplified constraint (1496) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1497)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[18], java.lang.Object(LinkedList(46, x3[18])), x1[18])), ≥)∧[278 + (-1)bso_92] + [3]x1[20] ≥ 0)

We simplified constraint (1497) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1498)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[18], java.lang.Object(LinkedList(46, x3[18])), x1[18])), ≥)∧[278 + (-1)bso_92] + [3]x1[20] ≥ 0)

We simplified constraint (1498) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1499)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[18], java.lang.Object(LinkedList(46, x3[18])), x1[18])), ≥)∧[278 + (-1)bso_92] + [3]x1[20] ≥ 0)

We simplified constraint (1499) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1500)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[18], java.lang.Object(LinkedList(46, x3[18])), x1[18])), ≥)∧0 ≥ 0∧0 ≥ 0∧[278 + (-1)bso_92] ≥ 0∧[1] ≥ 0)

For Pair 6432_0_TOPOSTFIX_NULL(x2, x3, java.lang.Object(LinkedList(44, x1))) → 6715_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(44, x1)), x2, x3) the following chains were created:

We consider the chain 6432_0_TOPOSTFIX_NULL(x2[19], x3[19], java.lang.Object(LinkedList(44, x1[19]))) → 6715_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(44, x1[19])), x2[19], x3[19]), 6715_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(44, x1[17])), x2[17], x3[17]) → 6432_0_TOPOSTFIX_NULL(x2[17], java.lang.Object(LinkedList(44, x3[17])), x1[17]) which results in the following constraint:
(1501)    (java.lang.Object(LinkedList(44, x1[19]))=java.lang.Object(LinkedList(44, x1[17]))∧x2[19]=x2[17]∧x3[19]=x3[17] ⇒ 6432_0_TOPOSTFIX_NULL(x2[19], x3[19], java.lang.Object(LinkedList(44, x1[19])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[19], x3[19], java.lang.Object(LinkedList(44, x1[19])))≥6715_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(44, x1[19])), x2[19], x3[19])∧(U^Increasing(6715_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(44, x1[19])), x2[19], x3[19])), ≥))

We simplified constraint (1501) using rules (I), (II), (IV), (DELETE_TRIVIAL_REDUCESTO) which results in the following new constraint:
(1502)    (6432_0_TOPOSTFIX_NULL(x2[19], x3[19], java.lang.Object(LinkedList(44, x1[19])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[19], x3[19], java.lang.Object(LinkedList(44, x1[19])))≥6715_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(44, x1[19])), x2[19], x3[19])∧(U^Increasing(6715_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(44, x1[19])), x2[19], x3[19])), ≥))

We simplified constraint (1502) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1503)    ((U^Increasing(6715_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(44, x1[19])), x2[19], x3[19])), ≥)∧[(-1)bso_94] ≥ 0)

We simplified constraint (1503) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1504)    ((U^Increasing(6715_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(44, x1[19])), x2[19], x3[19])), ≥)∧[(-1)bso_94] ≥ 0)

We simplified constraint (1504) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1505)    ((U^Increasing(6715_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(44, x1[19])), x2[19], x3[19])), ≥)∧[(-1)bso_94] ≥ 0)

We simplified constraint (1505) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(1506)    ((U^Increasing(6715_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(44, x1[19])), x2[19], x3[19])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_94] ≥ 0)

For Pair 6432_0_TOPOSTFIX_NULL(x2, x3, java.lang.Object(LinkedList(46, x1))) → 6725_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(46, x1)), x2, x3) the following chains were created:

We consider the chain 6432_0_TOPOSTFIX_NULL(x2[20], x3[20], java.lang.Object(LinkedList(46, x1[20]))) → 6725_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(46, x1[20])), x2[20], x3[20]), 6725_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(46, x1[18])), x2[18], x3[18]) → 6432_0_TOPOSTFIX_NULL(x2[18], java.lang.Object(LinkedList(46, x3[18])), x1[18]) which results in the following constraint:
(1507)    (java.lang.Object(LinkedList(46, x1[20]))=java.lang.Object(LinkedList(46, x1[18]))∧x2[20]=x2[18]∧x3[20]=x3[18] ⇒ 6432_0_TOPOSTFIX_NULL(x2[20], x3[20], java.lang.Object(LinkedList(46, x1[20])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[20], x3[20], java.lang.Object(LinkedList(46, x1[20])))≥6725_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(46, x1[20])), x2[20], x3[20])∧(U^Increasing(6725_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(46, x1[20])), x2[20], x3[20])), ≥))

We simplified constraint (1507) using rules (I), (II), (IV), (DELETE_TRIVIAL_REDUCESTO) which results in the following new constraint:
(1508)    (6432_0_TOPOSTFIX_NULL(x2[20], x3[20], java.lang.Object(LinkedList(46, x1[20])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[20], x3[20], java.lang.Object(LinkedList(46, x1[20])))≥6725_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(46, x1[20])), x2[20], x3[20])∧(U^Increasing(6725_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(46, x1[20])), x2[20], x3[20])), ≥))

We simplified constraint (1508) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1509)    ((U^Increasing(6725_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(46, x1[20])), x2[20], x3[20])), ≥)∧[(-1)bso_96] ≥ 0)

We simplified constraint (1509) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1510)    ((U^Increasing(6725_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(46, x1[20])), x2[20], x3[20])), ≥)∧[(-1)bso_96] ≥ 0)

We simplified constraint (1510) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1511)    ((U^Increasing(6725_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(46, x1[20])), x2[20], x3[20])), ≥)∧[(-1)bso_96] ≥ 0)

We simplified constraint (1511) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(1512)    ((U^Increasing(6725_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(46, x1[20])), x2[20], x3[20])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_96] ≥ 0)

For Pair 6432_0_TOPOSTFIX_NULL(x2, x3, java.lang.Object(LinkedList(40, x1))) → 7120_0_TOPOSTFIX_STORE(x2, x3, x1) the following chains were created:

We consider the chain 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0]) → 6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0]), 6432_0_TOPOSTFIX_NULL(x2[21], x3[21], java.lang.Object(LinkedList(40, x1[21]))) → 7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21]) which results in the following constraint:
(1513)    (x0[0]=x2[21]∧x1[0]=x3[21]∧x2[0]=java.lang.Object(LinkedList(40, x1[21])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[21], x3[21], java.lang.Object(LinkedList(40, x1[21])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[21], x3[21], java.lang.Object(LinkedList(40, x1[21])))≥7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])∧(U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥))

We simplified constraint (1513) using rule (III) which results in the following new constraint:
(1514)    (6432_0_TOPOSTFIX_NULL(x0[0], x1[0], java.lang.Object(LinkedList(40, x1[21])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x0[0], x1[0], java.lang.Object(LinkedList(40, x1[21])))≥7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x1[21])∧(U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥))

We simplified constraint (1514) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1515)    ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧[240 + (-1)bso_98] + [3]x1[21] ≥ 0)

We simplified constraint (1515) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1516)    ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧[240 + (-1)bso_98] + [3]x1[21] ≥ 0)

We simplified constraint (1516) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1517)    ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧[240 + (-1)bso_98] + [3]x1[21] ≥ 0)

We simplified constraint (1517) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1518)    ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧0 ≥ 0∧0 ≥ 0∧[240 + (-1)bso_98] ≥ 0∧[1] ≥ 0)
We consider the chain 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]) → 6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]), 6432_0_TOPOSTFIX_NULL(x2[21], x3[21], java.lang.Object(LinkedList(40, x1[21]))) → 7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21]) which results in the following constraint:
(1519)    (x0[1]=x2[21]∧java.lang.Object(LinkedList(x1[1], x2[1]))=x3[21]∧x3[1]=java.lang.Object(LinkedList(40, x1[21])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[21], x3[21], java.lang.Object(LinkedList(40, x1[21])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[21], x3[21], java.lang.Object(LinkedList(40, x1[21])))≥7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])∧(U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥))

We simplified constraint (1519) using rule (III) which results in the following new constraint:
(1520)    (6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(40, x1[21])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(40, x1[21])))≥7120_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x1[21])∧(U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥))

We simplified constraint (1520) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1521)    ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧[240 + (-1)bso_98] + [3]x1[21] ≥ 0)

We simplified constraint (1521) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1522)    ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧[240 + (-1)bso_98] + [3]x1[21] ≥ 0)

We simplified constraint (1522) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1523)    ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧[240 + (-1)bso_98] + [3]x1[21] ≥ 0)

We simplified constraint (1523) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1524)    ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[240 + (-1)bso_98] ≥ 0∧[1] ≥ 0)
We consider the chain 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]), 6432_0_TOPOSTFIX_NULL(x2[21], x3[21], java.lang.Object(LinkedList(40, x1[21]))) → 7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21]) which results in the following constraint:
(1525)    (java.lang.Object(LinkedList(42, x1[2]))=x2[21]∧x2[2]=x3[21]∧x3[2]=java.lang.Object(LinkedList(40, x1[21])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[21], x3[21], java.lang.Object(LinkedList(40, x1[21])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[21], x3[21], java.lang.Object(LinkedList(40, x1[21])))≥7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])∧(U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥))

We simplified constraint (1525) using rule (III) which results in the following new constraint:
(1526)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(40, x1[21])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(40, x1[21])))≥7120_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x1[21])∧(U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥))

We simplified constraint (1526) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1527)    ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧[240 + (-1)bso_98] + [3]x1[21] ≥ 0)

We simplified constraint (1527) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1528)    ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧[240 + (-1)bso_98] + [3]x1[21] ≥ 0)

We simplified constraint (1528) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1529)    ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧[240 + (-1)bso_98] + [3]x1[21] ≥ 0)

We simplified constraint (1529) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1530)    ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧0 ≥ 0∧0 ≥ 0∧[240 + (-1)bso_98] ≥ 0∧[1] ≥ 0)
We consider the chain 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]), 6432_0_TOPOSTFIX_NULL(x2[21], x3[21], java.lang.Object(LinkedList(40, x1[21]))) → 7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21]) which results in the following constraint:
(1531)    (java.lang.Object(LinkedList(43, x1[3]))=x2[21]∧x2[3]=x3[21]∧x3[3]=java.lang.Object(LinkedList(40, x1[21])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[21], x3[21], java.lang.Object(LinkedList(40, x1[21])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[21], x3[21], java.lang.Object(LinkedList(40, x1[21])))≥7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])∧(U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥))

We simplified constraint (1531) using rule (III) which results in the following new constraint:
(1532)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(40, x1[21])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(40, x1[21])))≥7120_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x1[21])∧(U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥))

We simplified constraint (1532) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1533)    ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧[240 + (-1)bso_98] + [3]x1[21] ≥ 0)

We simplified constraint (1533) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1534)    ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧[240 + (-1)bso_98] + [3]x1[21] ≥ 0)

We simplified constraint (1534) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1535)    ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧[240 + (-1)bso_98] + [3]x1[21] ≥ 0)

We simplified constraint (1535) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1536)    ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧0 ≥ 0∧0 ≥ 0∧[240 + (-1)bso_98] ≥ 0∧[1] ≥ 0)
We consider the chain 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]), 6432_0_TOPOSTFIX_NULL(x2[21], x3[21], java.lang.Object(LinkedList(40, x1[21]))) → 7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21]) which results in the following constraint:
(1537)    (java.lang.Object(LinkedList(45, x1[4]))=x2[21]∧x2[4]=x3[21]∧x3[4]=java.lang.Object(LinkedList(40, x1[21])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[21], x3[21], java.lang.Object(LinkedList(40, x1[21])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[21], x3[21], java.lang.Object(LinkedList(40, x1[21])))≥7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])∧(U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥))

We simplified constraint (1537) using rule (III) which results in the following new constraint:
(1538)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(40, x1[21])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(40, x1[21])))≥7120_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x1[21])∧(U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥))

We simplified constraint (1538) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1539)    ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧[240 + (-1)bso_98] + [3]x1[21] ≥ 0)

We simplified constraint (1539) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1540)    ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧[240 + (-1)bso_98] + [3]x1[21] ≥ 0)

We simplified constraint (1540) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1541)    ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧[240 + (-1)bso_98] + [3]x1[21] ≥ 0)

We simplified constraint (1541) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1542)    ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧0 ≥ 0∧0 ≥ 0∧[240 + (-1)bso_98] ≥ 0∧[1] ≥ 0)
We consider the chain 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]), 6432_0_TOPOSTFIX_NULL(x2[21], x3[21], java.lang.Object(LinkedList(40, x1[21]))) → 7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21]) which results in the following constraint:
(1543)    (java.lang.Object(LinkedList(47, x1[5]))=x2[21]∧x2[5]=x3[21]∧x3[5]=java.lang.Object(LinkedList(40, x1[21])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[21], x3[21], java.lang.Object(LinkedList(40, x1[21])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[21], x3[21], java.lang.Object(LinkedList(40, x1[21])))≥7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])∧(U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥))

We simplified constraint (1543) using rule (III) which results in the following new constraint:
(1544)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(40, x1[21])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(40, x1[21])))≥7120_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x1[21])∧(U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥))

We simplified constraint (1544) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1545)    ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧[240 + (-1)bso_98] + [3]x1[21] ≥ 0)

We simplified constraint (1545) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1546)    ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧[240 + (-1)bso_98] + [3]x1[21] ≥ 0)

We simplified constraint (1546) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1547)    ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧[240 + (-1)bso_98] + [3]x1[21] ≥ 0)

We simplified constraint (1547) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1548)    ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧0 ≥ 0∧0 ≥ 0∧[240 + (-1)bso_98] ≥ 0∧[1] ≥ 0)
We consider the chain COND_6432_0_TOPOSTFIX_NULL(TRUE, x2[7], x3[7], java.lang.Object(LinkedList(x0[7], x1[7]))) → 6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), x1[7]), 6432_0_TOPOSTFIX_NULL(x2[21], x3[21], java.lang.Object(LinkedList(40, x1[21]))) → 7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21]) which results in the following constraint:
(1549)    (x2[7]=x2[21]∧java.lang.Object(LinkedList(x0[7], x3[7]))=x3[21]∧x1[7]=java.lang.Object(LinkedList(40, x1[21])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[21], x3[21], java.lang.Object(LinkedList(40, x1[21])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[21], x3[21], java.lang.Object(LinkedList(40, x1[21])))≥7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])∧(U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥))

We simplified constraint (1549) using rule (III) which results in the following new constraint:
(1550)    (6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), java.lang.Object(LinkedList(40, x1[21])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), java.lang.Object(LinkedList(40, x1[21])))≥7120_0_TOPOSTFIX_STORE(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), x1[21])∧(U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥))

We simplified constraint (1550) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1551)    ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧[240 + (-1)bso_98] + [3]x1[21] ≥ 0)

We simplified constraint (1551) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1552)    ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧[240 + (-1)bso_98] + [3]x1[21] ≥ 0)

We simplified constraint (1552) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1553)    ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧[240 + (-1)bso_98] + [3]x1[21] ≥ 0)

We simplified constraint (1553) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1554)    ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[240 + (-1)bso_98] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8]))) → 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8]), 6432_0_TOPOSTFIX_NULL(x2[21], x3[21], java.lang.Object(LinkedList(40, x1[21]))) → 7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21]) which results in the following constraint:
(1555)    (x2[8]=x2[21]∧x3[8]=x3[21]∧x1[8]=java.lang.Object(LinkedList(40, x1[21])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[21], x3[21], java.lang.Object(LinkedList(40, x1[21])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[21], x3[21], java.lang.Object(LinkedList(40, x1[21])))≥7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])∧(U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥))

We simplified constraint (1555) using rule (III) which results in the following new constraint:
(1556)    (6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[21])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[21])))≥7120_0_TOPOSTFIX_STORE(x2[8], x3[8], x1[21])∧(U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥))

We simplified constraint (1556) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1557)    ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧[240 + (-1)bso_98] + [3]x1[21] ≥ 0)

We simplified constraint (1557) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1558)    ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧[240 + (-1)bso_98] + [3]x1[21] ≥ 0)

We simplified constraint (1558) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1559)    ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧[240 + (-1)bso_98] + [3]x1[21] ≥ 0)

We simplified constraint (1559) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1560)    ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧0 ≥ 0∧0 ≥ 0∧[240 + (-1)bso_98] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9]))) → 6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9]), 6432_0_TOPOSTFIX_NULL(x2[21], x3[21], java.lang.Object(LinkedList(40, x1[21]))) → 7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21]) which results in the following constraint:
(1561)    (x3[9]=x2[21]∧java.lang.Object(LinkedList(x2[9], x4[9]))=x3[21]∧x1[9]=java.lang.Object(LinkedList(40, x1[21])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[21], x3[21], java.lang.Object(LinkedList(40, x1[21])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[21], x3[21], java.lang.Object(LinkedList(40, x1[21])))≥7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])∧(U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥))

We simplified constraint (1561) using rule (III) which results in the following new constraint:
(1562)    (6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), java.lang.Object(LinkedList(40, x1[21])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), java.lang.Object(LinkedList(40, x1[21])))≥7120_0_TOPOSTFIX_STORE(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[21])∧(U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥))

We simplified constraint (1562) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1563)    ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧[240 + (-1)bso_98] + [3]x1[21] ≥ 0)

We simplified constraint (1563) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1564)    ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧[240 + (-1)bso_98] + [3]x1[21] ≥ 0)

We simplified constraint (1564) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1565)    ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧[240 + (-1)bso_98] + [3]x1[21] ≥ 0)

We simplified constraint (1565) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1566)    ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[240 + (-1)bso_98] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10]), 6432_0_TOPOSTFIX_NULL(x2[21], x3[21], java.lang.Object(LinkedList(40, x1[21]))) → 7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21]) which results in the following constraint:
(1567)    (java.lang.Object(LinkedList(42, x2[10]))=x2[21]∧x3[10]=x3[21]∧x1[10]=java.lang.Object(LinkedList(40, x1[21])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[21], x3[21], java.lang.Object(LinkedList(40, x1[21])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[21], x3[21], java.lang.Object(LinkedList(40, x1[21])))≥7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])∧(U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥))

We simplified constraint (1567) using rule (III) which results in the following new constraint:
(1568)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], java.lang.Object(LinkedList(40, x1[21])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], java.lang.Object(LinkedList(40, x1[21])))≥7120_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[21])∧(U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥))

We simplified constraint (1568) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1569)    ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧[240 + (-1)bso_98] + [3]x1[21] ≥ 0)

We simplified constraint (1569) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1570)    ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧[240 + (-1)bso_98] + [3]x1[21] ≥ 0)

We simplified constraint (1570) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1571)    ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧[240 + (-1)bso_98] + [3]x1[21] ≥ 0)

We simplified constraint (1571) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1572)    ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧0 ≥ 0∧0 ≥ 0∧[240 + (-1)bso_98] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11]), 6432_0_TOPOSTFIX_NULL(x2[21], x3[21], java.lang.Object(LinkedList(40, x1[21]))) → 7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21]) which results in the following constraint:
(1573)    (java.lang.Object(LinkedList(43, x2[11]))=x2[21]∧x3[11]=x3[21]∧x1[11]=java.lang.Object(LinkedList(40, x1[21])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[21], x3[21], java.lang.Object(LinkedList(40, x1[21])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[21], x3[21], java.lang.Object(LinkedList(40, x1[21])))≥7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])∧(U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥))

We simplified constraint (1573) using rule (III) which results in the following new constraint:
(1574)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], java.lang.Object(LinkedList(40, x1[21])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], java.lang.Object(LinkedList(40, x1[21])))≥7120_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[21])∧(U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥))

We simplified constraint (1574) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1575)    ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧[240 + (-1)bso_98] + [3]x1[21] ≥ 0)

We simplified constraint (1575) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1576)    ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧[240 + (-1)bso_98] + [3]x1[21] ≥ 0)

We simplified constraint (1576) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1577)    ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧[240 + (-1)bso_98] + [3]x1[21] ≥ 0)

We simplified constraint (1577) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1578)    ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧0 ≥ 0∧0 ≥ 0∧[240 + (-1)bso_98] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12]))) → 6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12]), 6432_0_TOPOSTFIX_NULL(x2[21], x3[21], java.lang.Object(LinkedList(40, x1[21]))) → 7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21]) which results in the following constraint:
(1579)    (x2[12]=x2[21]∧java.lang.Object(LinkedList(44, x3[12]))=x3[21]∧x1[12]=java.lang.Object(LinkedList(40, x1[21])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[21], x3[21], java.lang.Object(LinkedList(40, x1[21])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[21], x3[21], java.lang.Object(LinkedList(40, x1[21])))≥7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])∧(U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥))

We simplified constraint (1579) using rule (III) which results in the following new constraint:
(1580)    (6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), java.lang.Object(LinkedList(40, x1[21])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), java.lang.Object(LinkedList(40, x1[21])))≥7120_0_TOPOSTFIX_STORE(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[21])∧(U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥))

We simplified constraint (1580) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1581)    ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧[240 + (-1)bso_98] + [3]x1[21] ≥ 0)

We simplified constraint (1581) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1582)    ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧[240 + (-1)bso_98] + [3]x1[21] ≥ 0)

We simplified constraint (1582) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1583)    ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧[240 + (-1)bso_98] + [3]x1[21] ≥ 0)

We simplified constraint (1583) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1584)    ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧0 ≥ 0∧0 ≥ 0∧[240 + (-1)bso_98] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13]), 6432_0_TOPOSTFIX_NULL(x2[21], x3[21], java.lang.Object(LinkedList(40, x1[21]))) → 7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21]) which results in the following constraint:
(1585)    (java.lang.Object(LinkedList(45, x2[13]))=x2[21]∧x3[13]=x3[21]∧x1[13]=java.lang.Object(LinkedList(40, x1[21])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[21], x3[21], java.lang.Object(LinkedList(40, x1[21])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[21], x3[21], java.lang.Object(LinkedList(40, x1[21])))≥7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])∧(U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥))

We simplified constraint (1585) using rule (III) which results in the following new constraint:
(1586)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], java.lang.Object(LinkedList(40, x1[21])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], java.lang.Object(LinkedList(40, x1[21])))≥7120_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[21])∧(U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥))

We simplified constraint (1586) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1587)    ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧[240 + (-1)bso_98] + [3]x1[21] ≥ 0)

We simplified constraint (1587) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1588)    ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧[240 + (-1)bso_98] + [3]x1[21] ≥ 0)

We simplified constraint (1588) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1589)    ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧[240 + (-1)bso_98] + [3]x1[21] ≥ 0)

We simplified constraint (1589) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1590)    ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧0 ≥ 0∧0 ≥ 0∧[240 + (-1)bso_98] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14]))) → 6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14]), 6432_0_TOPOSTFIX_NULL(x2[21], x3[21], java.lang.Object(LinkedList(40, x1[21]))) → 7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21]) which results in the following constraint:
(1591)    (x2[14]=x2[21]∧java.lang.Object(LinkedList(46, x3[14]))=x3[21]∧x1[14]=java.lang.Object(LinkedList(40, x1[21])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[21], x3[21], java.lang.Object(LinkedList(40, x1[21])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[21], x3[21], java.lang.Object(LinkedList(40, x1[21])))≥7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])∧(U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥))

We simplified constraint (1591) using rule (III) which results in the following new constraint:
(1592)    (6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), java.lang.Object(LinkedList(40, x1[21])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), java.lang.Object(LinkedList(40, x1[21])))≥7120_0_TOPOSTFIX_STORE(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[21])∧(U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥))

We simplified constraint (1592) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1593)    ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧[240 + (-1)bso_98] + [3]x1[21] ≥ 0)

We simplified constraint (1593) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1594)    ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧[240 + (-1)bso_98] + [3]x1[21] ≥ 0)

We simplified constraint (1594) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1595)    ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧[240 + (-1)bso_98] + [3]x1[21] ≥ 0)

We simplified constraint (1595) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1596)    ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧0 ≥ 0∧0 ≥ 0∧[240 + (-1)bso_98] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15]), 6432_0_TOPOSTFIX_NULL(x2[21], x3[21], java.lang.Object(LinkedList(40, x1[21]))) → 7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21]) which results in the following constraint:
(1597)    (java.lang.Object(LinkedList(47, x2[15]))=x2[21]∧x3[15]=x3[21]∧x1[15]=java.lang.Object(LinkedList(40, x1[21])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[21], x3[21], java.lang.Object(LinkedList(40, x1[21])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[21], x3[21], java.lang.Object(LinkedList(40, x1[21])))≥7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])∧(U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥))

We simplified constraint (1597) using rule (III) which results in the following new constraint:
(1598)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], java.lang.Object(LinkedList(40, x1[21])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], java.lang.Object(LinkedList(40, x1[21])))≥7120_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[21])∧(U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥))

We simplified constraint (1598) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1599)    ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧[240 + (-1)bso_98] + [3]x1[21] ≥ 0)

We simplified constraint (1599) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1600)    ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧[240 + (-1)bso_98] + [3]x1[21] ≥ 0)

We simplified constraint (1600) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1601)    ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧[240 + (-1)bso_98] + [3]x1[21] ≥ 0)

We simplified constraint (1601) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1602)    ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧0 ≥ 0∧0 ≥ 0∧[240 + (-1)bso_98] ≥ 0∧[1] ≥ 0)
We consider the chain 6715_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(44, x1[17])), x2[17], x3[17]) → 6432_0_TOPOSTFIX_NULL(x2[17], java.lang.Object(LinkedList(44, x3[17])), x1[17]), 6432_0_TOPOSTFIX_NULL(x2[21], x3[21], java.lang.Object(LinkedList(40, x1[21]))) → 7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21]) which results in the following constraint:
(1603)    (x2[17]=x2[21]∧java.lang.Object(LinkedList(44, x3[17]))=x3[21]∧x1[17]=java.lang.Object(LinkedList(40, x1[21])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[21], x3[21], java.lang.Object(LinkedList(40, x1[21])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[21], x3[21], java.lang.Object(LinkedList(40, x1[21])))≥7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])∧(U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥))

We simplified constraint (1603) using rule (III) which results in the following new constraint:
(1604)    (6432_0_TOPOSTFIX_NULL(x2[17], java.lang.Object(LinkedList(44, x3[17])), java.lang.Object(LinkedList(40, x1[21])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[17], java.lang.Object(LinkedList(44, x3[17])), java.lang.Object(LinkedList(40, x1[21])))≥7120_0_TOPOSTFIX_STORE(x2[17], java.lang.Object(LinkedList(44, x3[17])), x1[21])∧(U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥))

We simplified constraint (1604) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1605)    ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧[240 + (-1)bso_98] + [3]x1[21] ≥ 0)

We simplified constraint (1605) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1606)    ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧[240 + (-1)bso_98] + [3]x1[21] ≥ 0)

We simplified constraint (1606) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1607)    ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧[240 + (-1)bso_98] + [3]x1[21] ≥ 0)

We simplified constraint (1607) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1608)    ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧0 ≥ 0∧0 ≥ 0∧[240 + (-1)bso_98] ≥ 0∧[1] ≥ 0)
We consider the chain 6725_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(46, x1[18])), x2[18], x3[18]) → 6432_0_TOPOSTFIX_NULL(x2[18], java.lang.Object(LinkedList(46, x3[18])), x1[18]), 6432_0_TOPOSTFIX_NULL(x2[21], x3[21], java.lang.Object(LinkedList(40, x1[21]))) → 7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21]) which results in the following constraint:
(1609)    (x2[18]=x2[21]∧java.lang.Object(LinkedList(46, x3[18]))=x3[21]∧x1[18]=java.lang.Object(LinkedList(40, x1[21])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[21], x3[21], java.lang.Object(LinkedList(40, x1[21])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[21], x3[21], java.lang.Object(LinkedList(40, x1[21])))≥7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])∧(U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥))

We simplified constraint (1609) using rule (III) which results in the following new constraint:
(1610)    (6432_0_TOPOSTFIX_NULL(x2[18], java.lang.Object(LinkedList(46, x3[18])), java.lang.Object(LinkedList(40, x1[21])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[18], java.lang.Object(LinkedList(46, x3[18])), java.lang.Object(LinkedList(40, x1[21])))≥7120_0_TOPOSTFIX_STORE(x2[18], java.lang.Object(LinkedList(46, x3[18])), x1[21])∧(U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥))

We simplified constraint (1610) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1611)    ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧[240 + (-1)bso_98] + [3]x1[21] ≥ 0)

We simplified constraint (1611) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1612)    ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧[240 + (-1)bso_98] + [3]x1[21] ≥ 0)

We simplified constraint (1612) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1613)    ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧[240 + (-1)bso_98] + [3]x1[21] ≥ 0)

We simplified constraint (1613) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1614)    ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧0 ≥ 0∧0 ≥ 0∧[240 + (-1)bso_98] ≥ 0∧[1] ≥ 0)

For Pair 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2, x3)), x4, java.lang.Object(LinkedList(41, x1))) → 8934_0_TOPOSTFIX_STORE(x3, java.lang.Object(LinkedList(x2, x4)), x1) the following chains were created:

We consider the chain 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0]) → 6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0]), 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x4[22], java.lang.Object(LinkedList(41, x1[22]))) → 8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22]) which results in the following constraint:
(1615)    (x0[0]=java.lang.Object(LinkedList(x2[22], x3[22]))∧x1[0]=x4[22]∧x2[0]=java.lang.Object(LinkedList(41, x1[22])) ⇒ 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x4[22], java.lang.Object(LinkedList(41, x1[22])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x4[22], java.lang.Object(LinkedList(41, x1[22])))≥8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])∧(U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥))

We simplified constraint (1615) using rule (III) which results in the following new constraint:
(1616)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x1[0], java.lang.Object(LinkedList(41, x1[22])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x1[0], java.lang.Object(LinkedList(41, x1[22])))≥8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x1[0])), x1[22])∧(U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥))

We simplified constraint (1616) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1617)    ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧[248 + (-1)bso_100] + [3]x1[22] ≥ 0)

We simplified constraint (1617) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1618)    ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧[248 + (-1)bso_100] + [3]x1[22] ≥ 0)

We simplified constraint (1618) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1619)    ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧[248 + (-1)bso_100] + [3]x1[22] ≥ 0)

We simplified constraint (1619) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1620)    ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[248 + (-1)bso_100] ≥ 0∧[1] ≥ 0)
We consider the chain 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]) → 6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]), 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x4[22], java.lang.Object(LinkedList(41, x1[22]))) → 8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22]) which results in the following constraint:
(1621)    (x0[1]=java.lang.Object(LinkedList(x2[22], x3[22]))∧java.lang.Object(LinkedList(x1[1], x2[1]))=x4[22]∧x3[1]=java.lang.Object(LinkedList(41, x1[22])) ⇒ 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x4[22], java.lang.Object(LinkedList(41, x1[22])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x4[22], java.lang.Object(LinkedList(41, x1[22])))≥8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])∧(U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥))

We simplified constraint (1621) using rule (III) which results in the following new constraint:
(1622)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(41, x1[22])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(41, x1[22])))≥8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], java.lang.Object(LinkedList(x1[1], x2[1])))), x1[22])∧(U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥))

We simplified constraint (1622) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1623)    ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧[248 + (-1)bso_100] + [3]x1[22] ≥ 0)

We simplified constraint (1623) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1624)    ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧[248 + (-1)bso_100] + [3]x1[22] ≥ 0)

We simplified constraint (1624) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1625)    ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧[248 + (-1)bso_100] + [3]x1[22] ≥ 0)

We simplified constraint (1625) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1626)    ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[248 + (-1)bso_100] ≥ 0∧[1] ≥ 0)
We consider the chain 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]), 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x4[22], java.lang.Object(LinkedList(41, x1[22]))) → 8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22]) which results in the following constraint:
(1627)    (java.lang.Object(LinkedList(42, x1[2]))=java.lang.Object(LinkedList(x2[22], x3[22]))∧x2[2]=x4[22]∧x3[2]=java.lang.Object(LinkedList(41, x1[22])) ⇒ 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x4[22], java.lang.Object(LinkedList(41, x1[22])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x4[22], java.lang.Object(LinkedList(41, x1[22])))≥8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])∧(U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥))

We simplified constraint (1627) using rules (I), (II), (III) which results in the following new constraint:
(1628)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(41, x1[22])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(41, x1[22])))≥8934_0_TOPOSTFIX_STORE(x1[2], java.lang.Object(LinkedList(42, x2[2])), x1[22])∧(U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥))

We simplified constraint (1628) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1629)    ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧[248 + (-1)bso_100] + [3]x1[22] ≥ 0)

We simplified constraint (1629) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1630)    ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧[248 + (-1)bso_100] + [3]x1[22] ≥ 0)

We simplified constraint (1630) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1631)    ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧[248 + (-1)bso_100] + [3]x1[22] ≥ 0)

We simplified constraint (1631) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1632)    ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧0 ≥ 0∧0 ≥ 0∧[248 + (-1)bso_100] ≥ 0∧[1] ≥ 0)
We consider the chain 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]), 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x4[22], java.lang.Object(LinkedList(41, x1[22]))) → 8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22]) which results in the following constraint:
(1633)    (java.lang.Object(LinkedList(43, x1[3]))=java.lang.Object(LinkedList(x2[22], x3[22]))∧x2[3]=x4[22]∧x3[3]=java.lang.Object(LinkedList(41, x1[22])) ⇒ 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x4[22], java.lang.Object(LinkedList(41, x1[22])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x4[22], java.lang.Object(LinkedList(41, x1[22])))≥8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])∧(U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥))

We simplified constraint (1633) using rules (I), (II), (III) which results in the following new constraint:
(1634)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(41, x1[22])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(41, x1[22])))≥8934_0_TOPOSTFIX_STORE(x1[3], java.lang.Object(LinkedList(43, x2[3])), x1[22])∧(U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥))

We simplified constraint (1634) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1635)    ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧[248 + (-1)bso_100] + [3]x1[22] ≥ 0)

We simplified constraint (1635) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1636)    ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧[248 + (-1)bso_100] + [3]x1[22] ≥ 0)

We simplified constraint (1636) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1637)    ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧[248 + (-1)bso_100] + [3]x1[22] ≥ 0)

We simplified constraint (1637) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1638)    ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧0 ≥ 0∧0 ≥ 0∧[248 + (-1)bso_100] ≥ 0∧[1] ≥ 0)
We consider the chain 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]), 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x4[22], java.lang.Object(LinkedList(41, x1[22]))) → 8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22]) which results in the following constraint:
(1639)    (java.lang.Object(LinkedList(45, x1[4]))=java.lang.Object(LinkedList(x2[22], x3[22]))∧x2[4]=x4[22]∧x3[4]=java.lang.Object(LinkedList(41, x1[22])) ⇒ 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x4[22], java.lang.Object(LinkedList(41, x1[22])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x4[22], java.lang.Object(LinkedList(41, x1[22])))≥8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])∧(U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥))

We simplified constraint (1639) using rules (I), (II), (III) which results in the following new constraint:
(1640)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(41, x1[22])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(41, x1[22])))≥8934_0_TOPOSTFIX_STORE(x1[4], java.lang.Object(LinkedList(45, x2[4])), x1[22])∧(U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥))

We simplified constraint (1640) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1641)    ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧[248 + (-1)bso_100] + [3]x1[22] ≥ 0)

We simplified constraint (1641) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1642)    ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧[248 + (-1)bso_100] + [3]x1[22] ≥ 0)

We simplified constraint (1642) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1643)    ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧[248 + (-1)bso_100] + [3]x1[22] ≥ 0)

We simplified constraint (1643) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1644)    ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧0 ≥ 0∧0 ≥ 0∧[248 + (-1)bso_100] ≥ 0∧[1] ≥ 0)
We consider the chain 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]), 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x4[22], java.lang.Object(LinkedList(41, x1[22]))) → 8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22]) which results in the following constraint:
(1645)    (java.lang.Object(LinkedList(47, x1[5]))=java.lang.Object(LinkedList(x2[22], x3[22]))∧x2[5]=x4[22]∧x3[5]=java.lang.Object(LinkedList(41, x1[22])) ⇒ 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x4[22], java.lang.Object(LinkedList(41, x1[22])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x4[22], java.lang.Object(LinkedList(41, x1[22])))≥8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])∧(U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥))

We simplified constraint (1645) using rules (I), (II), (III) which results in the following new constraint:
(1646)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(41, x1[22])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(41, x1[22])))≥8934_0_TOPOSTFIX_STORE(x1[5], java.lang.Object(LinkedList(47, x2[5])), x1[22])∧(U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥))

We simplified constraint (1646) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1647)    ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧[248 + (-1)bso_100] + [3]x1[22] ≥ 0)

We simplified constraint (1647) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1648)    ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧[248 + (-1)bso_100] + [3]x1[22] ≥ 0)

We simplified constraint (1648) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1649)    ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧[248 + (-1)bso_100] + [3]x1[22] ≥ 0)

We simplified constraint (1649) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1650)    ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧0 ≥ 0∧0 ≥ 0∧[248 + (-1)bso_100] ≥ 0∧[1] ≥ 0)
We consider the chain COND_6432_0_TOPOSTFIX_NULL(TRUE, x2[7], x3[7], java.lang.Object(LinkedList(x0[7], x1[7]))) → 6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), x1[7]), 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x4[22], java.lang.Object(LinkedList(41, x1[22]))) → 8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22]) which results in the following constraint:
(1651)    (x2[7]=java.lang.Object(LinkedList(x2[22], x3[22]))∧java.lang.Object(LinkedList(x0[7], x3[7]))=x4[22]∧x1[7]=java.lang.Object(LinkedList(41, x1[22])) ⇒ 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x4[22], java.lang.Object(LinkedList(41, x1[22])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x4[22], java.lang.Object(LinkedList(41, x1[22])))≥8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])∧(U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥))

We simplified constraint (1651) using rule (III) which results in the following new constraint:
(1652)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), java.lang.Object(LinkedList(x0[7], x3[7])), java.lang.Object(LinkedList(41, x1[22])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), java.lang.Object(LinkedList(x0[7], x3[7])), java.lang.Object(LinkedList(41, x1[22])))≥8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], java.lang.Object(LinkedList(x0[7], x3[7])))), x1[22])∧(U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥))

We simplified constraint (1652) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1653)    ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧[248 + (-1)bso_100] + [3]x1[22] ≥ 0)

We simplified constraint (1653) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1654)    ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧[248 + (-1)bso_100] + [3]x1[22] ≥ 0)

We simplified constraint (1654) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1655)    ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧[248 + (-1)bso_100] + [3]x1[22] ≥ 0)

We simplified constraint (1655) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1656)    ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[248 + (-1)bso_100] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8]))) → 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8]), 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x4[22], java.lang.Object(LinkedList(41, x1[22]))) → 8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22]) which results in the following constraint:
(1657)    (x2[8]=java.lang.Object(LinkedList(x2[22], x3[22]))∧x3[8]=x4[22]∧x1[8]=java.lang.Object(LinkedList(41, x1[22])) ⇒ 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x4[22], java.lang.Object(LinkedList(41, x1[22])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x4[22], java.lang.Object(LinkedList(41, x1[22])))≥8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])∧(U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥))

We simplified constraint (1657) using rule (III) which results in the following new constraint:
(1658)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x3[8], java.lang.Object(LinkedList(41, x1[22])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x3[8], java.lang.Object(LinkedList(41, x1[22])))≥8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x3[8])), x1[22])∧(U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥))

We simplified constraint (1658) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1659)    ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧[248 + (-1)bso_100] + [3]x1[22] ≥ 0)

We simplified constraint (1659) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1660)    ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧[248 + (-1)bso_100] + [3]x1[22] ≥ 0)

We simplified constraint (1660) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1661)    ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧[248 + (-1)bso_100] + [3]x1[22] ≥ 0)

We simplified constraint (1661) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1662)    ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[248 + (-1)bso_100] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9]))) → 6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9]), 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x4[22], java.lang.Object(LinkedList(41, x1[22]))) → 8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22]) which results in the following constraint:
(1663)    (x3[9]=java.lang.Object(LinkedList(x2[22], x3[22]))∧java.lang.Object(LinkedList(x2[9], x4[9]))=x4[22]∧x1[9]=java.lang.Object(LinkedList(41, x1[22])) ⇒ 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x4[22], java.lang.Object(LinkedList(41, x1[22])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x4[22], java.lang.Object(LinkedList(41, x1[22])))≥8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])∧(U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥))

We simplified constraint (1663) using rule (III) which results in the following new constraint:
(1664)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), java.lang.Object(LinkedList(x2[9], x4[9])), java.lang.Object(LinkedList(41, x1[22])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), java.lang.Object(LinkedList(x2[9], x4[9])), java.lang.Object(LinkedList(41, x1[22])))≥8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], java.lang.Object(LinkedList(x2[9], x4[9])))), x1[22])∧(U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥))

We simplified constraint (1664) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1665)    ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧[248 + (-1)bso_100] + [3]x1[22] ≥ 0)

We simplified constraint (1665) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1666)    ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧[248 + (-1)bso_100] + [3]x1[22] ≥ 0)

We simplified constraint (1666) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1667)    ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧[248 + (-1)bso_100] + [3]x1[22] ≥ 0)

We simplified constraint (1667) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1668)    ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[248 + (-1)bso_100] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10]), 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x4[22], java.lang.Object(LinkedList(41, x1[22]))) → 8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22]) which results in the following constraint:
(1669)    (java.lang.Object(LinkedList(42, x2[10]))=java.lang.Object(LinkedList(x2[22], x3[22]))∧x3[10]=x4[22]∧x1[10]=java.lang.Object(LinkedList(41, x1[22])) ⇒ 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x4[22], java.lang.Object(LinkedList(41, x1[22])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x4[22], java.lang.Object(LinkedList(41, x1[22])))≥8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])∧(U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥))

We simplified constraint (1669) using rules (I), (II), (III) which results in the following new constraint:
(1670)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], java.lang.Object(LinkedList(41, x1[22])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], java.lang.Object(LinkedList(41, x1[22])))≥8934_0_TOPOSTFIX_STORE(x2[10], java.lang.Object(LinkedList(42, x3[10])), x1[22])∧(U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥))

We simplified constraint (1670) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1671)    ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧[248 + (-1)bso_100] + [3]x1[22] ≥ 0)

We simplified constraint (1671) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1672)    ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧[248 + (-1)bso_100] + [3]x1[22] ≥ 0)

We simplified constraint (1672) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1673)    ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧[248 + (-1)bso_100] + [3]x1[22] ≥ 0)

We simplified constraint (1673) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1674)    ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧0 ≥ 0∧0 ≥ 0∧[248 + (-1)bso_100] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11]), 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x4[22], java.lang.Object(LinkedList(41, x1[22]))) → 8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22]) which results in the following constraint:
(1675)    (java.lang.Object(LinkedList(43, x2[11]))=java.lang.Object(LinkedList(x2[22], x3[22]))∧x3[11]=x4[22]∧x1[11]=java.lang.Object(LinkedList(41, x1[22])) ⇒ 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x4[22], java.lang.Object(LinkedList(41, x1[22])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x4[22], java.lang.Object(LinkedList(41, x1[22])))≥8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])∧(U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥))

We simplified constraint (1675) using rules (I), (II), (III) which results in the following new constraint:
(1676)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], java.lang.Object(LinkedList(41, x1[22])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], java.lang.Object(LinkedList(41, x1[22])))≥8934_0_TOPOSTFIX_STORE(x2[11], java.lang.Object(LinkedList(43, x3[11])), x1[22])∧(U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥))

We simplified constraint (1676) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1677)    ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧[248 + (-1)bso_100] + [3]x1[22] ≥ 0)

We simplified constraint (1677) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1678)    ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧[248 + (-1)bso_100] + [3]x1[22] ≥ 0)

We simplified constraint (1678) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1679)    ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧[248 + (-1)bso_100] + [3]x1[22] ≥ 0)

We simplified constraint (1679) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1680)    ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧0 ≥ 0∧0 ≥ 0∧[248 + (-1)bso_100] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12]))) → 6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12]), 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x4[22], java.lang.Object(LinkedList(41, x1[22]))) → 8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22]) which results in the following constraint:
(1681)    (x2[12]=java.lang.Object(LinkedList(x2[22], x3[22]))∧java.lang.Object(LinkedList(44, x3[12]))=x4[22]∧x1[12]=java.lang.Object(LinkedList(41, x1[22])) ⇒ 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x4[22], java.lang.Object(LinkedList(41, x1[22])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x4[22], java.lang.Object(LinkedList(41, x1[22])))≥8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])∧(U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥))

We simplified constraint (1681) using rule (III) which results in the following new constraint:
(1682)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), java.lang.Object(LinkedList(44, x3[12])), java.lang.Object(LinkedList(41, x1[22])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), java.lang.Object(LinkedList(44, x3[12])), java.lang.Object(LinkedList(41, x1[22])))≥8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], java.lang.Object(LinkedList(44, x3[12])))), x1[22])∧(U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥))

We simplified constraint (1682) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1683)    ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧[248 + (-1)bso_100] + [3]x1[22] ≥ 0)

We simplified constraint (1683) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1684)    ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧[248 + (-1)bso_100] + [3]x1[22] ≥ 0)

We simplified constraint (1684) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1685)    ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧[248 + (-1)bso_100] + [3]x1[22] ≥ 0)

We simplified constraint (1685) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1686)    ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[248 + (-1)bso_100] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13]), 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x4[22], java.lang.Object(LinkedList(41, x1[22]))) → 8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22]) which results in the following constraint:
(1687)    (java.lang.Object(LinkedList(45, x2[13]))=java.lang.Object(LinkedList(x2[22], x3[22]))∧x3[13]=x4[22]∧x1[13]=java.lang.Object(LinkedList(41, x1[22])) ⇒ 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x4[22], java.lang.Object(LinkedList(41, x1[22])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x4[22], java.lang.Object(LinkedList(41, x1[22])))≥8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])∧(U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥))

We simplified constraint (1687) using rules (I), (II), (III) which results in the following new constraint:
(1688)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], java.lang.Object(LinkedList(41, x1[22])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], java.lang.Object(LinkedList(41, x1[22])))≥8934_0_TOPOSTFIX_STORE(x2[13], java.lang.Object(LinkedList(45, x3[13])), x1[22])∧(U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥))

We simplified constraint (1688) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1689)    ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧[248 + (-1)bso_100] + [3]x1[22] ≥ 0)

We simplified constraint (1689) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1690)    ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧[248 + (-1)bso_100] + [3]x1[22] ≥ 0)

We simplified constraint (1690) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1691)    ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧[248 + (-1)bso_100] + [3]x1[22] ≥ 0)

We simplified constraint (1691) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1692)    ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧0 ≥ 0∧0 ≥ 0∧[248 + (-1)bso_100] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14]))) → 6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14]), 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x4[22], java.lang.Object(LinkedList(41, x1[22]))) → 8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22]) which results in the following constraint:
(1693)    (x2[14]=java.lang.Object(LinkedList(x2[22], x3[22]))∧java.lang.Object(LinkedList(46, x3[14]))=x4[22]∧x1[14]=java.lang.Object(LinkedList(41, x1[22])) ⇒ 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x4[22], java.lang.Object(LinkedList(41, x1[22])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x4[22], java.lang.Object(LinkedList(41, x1[22])))≥8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])∧(U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥))

We simplified constraint (1693) using rule (III) which results in the following new constraint:
(1694)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), java.lang.Object(LinkedList(46, x3[14])), java.lang.Object(LinkedList(41, x1[22])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), java.lang.Object(LinkedList(46, x3[14])), java.lang.Object(LinkedList(41, x1[22])))≥8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], java.lang.Object(LinkedList(46, x3[14])))), x1[22])∧(U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥))

We simplified constraint (1694) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1695)    ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧[248 + (-1)bso_100] + [3]x1[22] ≥ 0)

We simplified constraint (1695) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1696)    ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧[248 + (-1)bso_100] + [3]x1[22] ≥ 0)

We simplified constraint (1696) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1697)    ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧[248 + (-1)bso_100] + [3]x1[22] ≥ 0)

We simplified constraint (1697) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1698)    ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[248 + (-1)bso_100] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15]), 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x4[22], java.lang.Object(LinkedList(41, x1[22]))) → 8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22]) which results in the following constraint:
(1699)    (java.lang.Object(LinkedList(47, x2[15]))=java.lang.Object(LinkedList(x2[22], x3[22]))∧x3[15]=x4[22]∧x1[15]=java.lang.Object(LinkedList(41, x1[22])) ⇒ 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x4[22], java.lang.Object(LinkedList(41, x1[22])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x4[22], java.lang.Object(LinkedList(41, x1[22])))≥8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])∧(U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥))

We simplified constraint (1699) using rules (I), (II), (III) which results in the following new constraint:
(1700)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], java.lang.Object(LinkedList(41, x1[22])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], java.lang.Object(LinkedList(41, x1[22])))≥8934_0_TOPOSTFIX_STORE(x2[15], java.lang.Object(LinkedList(47, x3[15])), x1[22])∧(U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥))

We simplified constraint (1700) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1701)    ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧[248 + (-1)bso_100] + [3]x1[22] ≥ 0)

We simplified constraint (1701) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1702)    ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧[248 + (-1)bso_100] + [3]x1[22] ≥ 0)

We simplified constraint (1702) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1703)    ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧[248 + (-1)bso_100] + [3]x1[22] ≥ 0)

We simplified constraint (1703) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1704)    ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧0 ≥ 0∧0 ≥ 0∧[248 + (-1)bso_100] ≥ 0∧[1] ≥ 0)
We consider the chain 6715_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(44, x1[17])), x2[17], x3[17]) → 6432_0_TOPOSTFIX_NULL(x2[17], java.lang.Object(LinkedList(44, x3[17])), x1[17]), 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x4[22], java.lang.Object(LinkedList(41, x1[22]))) → 8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22]) which results in the following constraint:
(1705)    (x2[17]=java.lang.Object(LinkedList(x2[22], x3[22]))∧java.lang.Object(LinkedList(44, x3[17]))=x4[22]∧x1[17]=java.lang.Object(LinkedList(41, x1[22])) ⇒ 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x4[22], java.lang.Object(LinkedList(41, x1[22])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x4[22], java.lang.Object(LinkedList(41, x1[22])))≥8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])∧(U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥))

We simplified constraint (1705) using rule (III) which results in the following new constraint:
(1706)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), java.lang.Object(LinkedList(44, x3[17])), java.lang.Object(LinkedList(41, x1[22])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), java.lang.Object(LinkedList(44, x3[17])), java.lang.Object(LinkedList(41, x1[22])))≥8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], java.lang.Object(LinkedList(44, x3[17])))), x1[22])∧(U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥))

We simplified constraint (1706) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1707)    ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧[248 + (-1)bso_100] + [3]x1[22] ≥ 0)

We simplified constraint (1707) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1708)    ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧[248 + (-1)bso_100] + [3]x1[22] ≥ 0)

We simplified constraint (1708) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1709)    ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧[248 + (-1)bso_100] + [3]x1[22] ≥ 0)

We simplified constraint (1709) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1710)    ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[248 + (-1)bso_100] ≥ 0∧[1] ≥ 0)
We consider the chain 6725_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(46, x1[18])), x2[18], x3[18]) → 6432_0_TOPOSTFIX_NULL(x2[18], java.lang.Object(LinkedList(46, x3[18])), x1[18]), 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x4[22], java.lang.Object(LinkedList(41, x1[22]))) → 8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22]) which results in the following constraint:
(1711)    (x2[18]=java.lang.Object(LinkedList(x2[22], x3[22]))∧java.lang.Object(LinkedList(46, x3[18]))=x4[22]∧x1[18]=java.lang.Object(LinkedList(41, x1[22])) ⇒ 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x4[22], java.lang.Object(LinkedList(41, x1[22])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x4[22], java.lang.Object(LinkedList(41, x1[22])))≥8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])∧(U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥))

We simplified constraint (1711) using rule (III) which results in the following new constraint:
(1712)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), java.lang.Object(LinkedList(46, x3[18])), java.lang.Object(LinkedList(41, x1[22])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), java.lang.Object(LinkedList(46, x3[18])), java.lang.Object(LinkedList(41, x1[22])))≥8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], java.lang.Object(LinkedList(46, x3[18])))), x1[22])∧(U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥))

We simplified constraint (1712) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1713)    ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧[248 + (-1)bso_100] + [3]x1[22] ≥ 0)

We simplified constraint (1713) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1714)    ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧[248 + (-1)bso_100] + [3]x1[22] ≥ 0)

We simplified constraint (1714) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1715)    ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧[248 + (-1)bso_100] + [3]x1[22] ≥ 0)

We simplified constraint (1715) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1716)    ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[248 + (-1)bso_100] ≥ 0∧[1] ≥ 0)

For Pair 6432_0_TOPOSTFIX_NULL(x2, x3, java.lang.Object(LinkedList(42, x1))) → 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2)), x3, x1) the following chains were created:

We consider the chain 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0]) → 6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0]), 6432_0_TOPOSTFIX_NULL(x2[23], x3[23], java.lang.Object(LinkedList(42, x1[23]))) → 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23]) which results in the following constraint:
(1717)    (x0[0]=x2[23]∧x1[0]=x3[23]∧x2[0]=java.lang.Object(LinkedList(42, x1[23])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[23], x3[23], java.lang.Object(LinkedList(42, x1[23])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[23], x3[23], java.lang.Object(LinkedList(42, x1[23])))≥8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])∧(U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥))

We simplified constraint (1717) using rule (III) which results in the following new constraint:
(1718)    (6432_0_TOPOSTFIX_NULL(x0[0], x1[0], java.lang.Object(LinkedList(42, x1[23])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x0[0], x1[0], java.lang.Object(LinkedList(42, x1[23])))≥8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x0[0])), x1[0], x1[23])∧(U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥))

We simplified constraint (1718) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1719)    ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧[253 + (-1)bso_102] + [2]x1[23] ≥ 0)

We simplified constraint (1719) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1720)    ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧[253 + (-1)bso_102] + [2]x1[23] ≥ 0)

We simplified constraint (1720) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1721)    ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧[253 + (-1)bso_102] + [2]x1[23] ≥ 0)

We simplified constraint (1721) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1722)    ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧0 ≥ 0∧0 ≥ 0∧[253 + (-1)bso_102] ≥ 0∧[1] ≥ 0)
We consider the chain 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]) → 6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]), 6432_0_TOPOSTFIX_NULL(x2[23], x3[23], java.lang.Object(LinkedList(42, x1[23]))) → 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23]) which results in the following constraint:
(1723)    (x0[1]=x2[23]∧java.lang.Object(LinkedList(x1[1], x2[1]))=x3[23]∧x3[1]=java.lang.Object(LinkedList(42, x1[23])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[23], x3[23], java.lang.Object(LinkedList(42, x1[23])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[23], x3[23], java.lang.Object(LinkedList(42, x1[23])))≥8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])∧(U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥))

We simplified constraint (1723) using rule (III) which results in the following new constraint:
(1724)    (6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(42, x1[23])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(42, x1[23])))≥8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x0[1])), java.lang.Object(LinkedList(x1[1], x2[1])), x1[23])∧(U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥))

We simplified constraint (1724) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1725)    ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧[253 + (-1)bso_102] + [2]x1[23] ≥ 0)

We simplified constraint (1725) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1726)    ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧[253 + (-1)bso_102] + [2]x1[23] ≥ 0)

We simplified constraint (1726) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1727)    ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧[253 + (-1)bso_102] + [2]x1[23] ≥ 0)

We simplified constraint (1727) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1728)    ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[253 + (-1)bso_102] ≥ 0∧[1] ≥ 0)
We consider the chain 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]), 6432_0_TOPOSTFIX_NULL(x2[23], x3[23], java.lang.Object(LinkedList(42, x1[23]))) → 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23]) which results in the following constraint:
(1729)    (java.lang.Object(LinkedList(42, x1[2]))=x2[23]∧x2[2]=x3[23]∧x3[2]=java.lang.Object(LinkedList(42, x1[23])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[23], x3[23], java.lang.Object(LinkedList(42, x1[23])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[23], x3[23], java.lang.Object(LinkedList(42, x1[23])))≥8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])∧(U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥))

We simplified constraint (1729) using rule (III) which results in the following new constraint:
(1730)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(42, x1[23])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(42, x1[23])))≥8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, java.lang.Object(LinkedList(42, x1[2])))), x2[2], x1[23])∧(U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥))

We simplified constraint (1730) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1731)    ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧[253 + (-1)bso_102] + [2]x1[23] ≥ 0)

We simplified constraint (1731) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1732)    ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧[253 + (-1)bso_102] + [2]x1[23] ≥ 0)

We simplified constraint (1732) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1733)    ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧[253 + (-1)bso_102] + [2]x1[23] ≥ 0)

We simplified constraint (1733) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1734)    ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧0 ≥ 0∧0 ≥ 0∧[253 + (-1)bso_102] ≥ 0∧[1] ≥ 0)
We consider the chain 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]), 6432_0_TOPOSTFIX_NULL(x2[23], x3[23], java.lang.Object(LinkedList(42, x1[23]))) → 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23]) which results in the following constraint:
(1735)    (java.lang.Object(LinkedList(43, x1[3]))=x2[23]∧x2[3]=x3[23]∧x3[3]=java.lang.Object(LinkedList(42, x1[23])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[23], x3[23], java.lang.Object(LinkedList(42, x1[23])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[23], x3[23], java.lang.Object(LinkedList(42, x1[23])))≥8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])∧(U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥))

We simplified constraint (1735) using rule (III) which results in the following new constraint:
(1736)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(42, x1[23])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(42, x1[23])))≥8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, java.lang.Object(LinkedList(43, x1[3])))), x2[3], x1[23])∧(U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥))

We simplified constraint (1736) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1737)    ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧[253 + (-1)bso_102] + [2]x1[23] ≥ 0)

We simplified constraint (1737) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1738)    ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧[253 + (-1)bso_102] + [2]x1[23] ≥ 0)

We simplified constraint (1738) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1739)    ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧[253 + (-1)bso_102] + [2]x1[23] ≥ 0)

We simplified constraint (1739) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1740)    ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧0 ≥ 0∧0 ≥ 0∧[253 + (-1)bso_102] ≥ 0∧[1] ≥ 0)
We consider the chain 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]), 6432_0_TOPOSTFIX_NULL(x2[23], x3[23], java.lang.Object(LinkedList(42, x1[23]))) → 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23]) which results in the following constraint:
(1741)    (java.lang.Object(LinkedList(45, x1[4]))=x2[23]∧x2[4]=x3[23]∧x3[4]=java.lang.Object(LinkedList(42, x1[23])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[23], x3[23], java.lang.Object(LinkedList(42, x1[23])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[23], x3[23], java.lang.Object(LinkedList(42, x1[23])))≥8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])∧(U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥))

We simplified constraint (1741) using rule (III) which results in the following new constraint:
(1742)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(42, x1[23])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(42, x1[23])))≥8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, java.lang.Object(LinkedList(45, x1[4])))), x2[4], x1[23])∧(U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥))

We simplified constraint (1742) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1743)    ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧[253 + (-1)bso_102] + [2]x1[23] ≥ 0)

We simplified constraint (1743) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1744)    ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧[253 + (-1)bso_102] + [2]x1[23] ≥ 0)

We simplified constraint (1744) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1745)    ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧[253 + (-1)bso_102] + [2]x1[23] ≥ 0)

We simplified constraint (1745) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1746)    ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧0 ≥ 0∧0 ≥ 0∧[253 + (-1)bso_102] ≥ 0∧[1] ≥ 0)
We consider the chain 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]), 6432_0_TOPOSTFIX_NULL(x2[23], x3[23], java.lang.Object(LinkedList(42, x1[23]))) → 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23]) which results in the following constraint:
(1747)    (java.lang.Object(LinkedList(47, x1[5]))=x2[23]∧x2[5]=x3[23]∧x3[5]=java.lang.Object(LinkedList(42, x1[23])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[23], x3[23], java.lang.Object(LinkedList(42, x1[23])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[23], x3[23], java.lang.Object(LinkedList(42, x1[23])))≥8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])∧(U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥))

We simplified constraint (1747) using rule (III) which results in the following new constraint:
(1748)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(42, x1[23])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(42, x1[23])))≥8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, java.lang.Object(LinkedList(47, x1[5])))), x2[5], x1[23])∧(U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥))

We simplified constraint (1748) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1749)    ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧[253 + (-1)bso_102] + [2]x1[23] ≥ 0)

We simplified constraint (1749) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1750)    ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧[253 + (-1)bso_102] + [2]x1[23] ≥ 0)

We simplified constraint (1750) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1751)    ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧[253 + (-1)bso_102] + [2]x1[23] ≥ 0)

We simplified constraint (1751) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1752)    ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧0 ≥ 0∧0 ≥ 0∧[253 + (-1)bso_102] ≥ 0∧[1] ≥ 0)
We consider the chain COND_6432_0_TOPOSTFIX_NULL(TRUE, x2[7], x3[7], java.lang.Object(LinkedList(x0[7], x1[7]))) → 6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), x1[7]), 6432_0_TOPOSTFIX_NULL(x2[23], x3[23], java.lang.Object(LinkedList(42, x1[23]))) → 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23]) which results in the following constraint:
(1753)    (x2[7]=x2[23]∧java.lang.Object(LinkedList(x0[7], x3[7]))=x3[23]∧x1[7]=java.lang.Object(LinkedList(42, x1[23])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[23], x3[23], java.lang.Object(LinkedList(42, x1[23])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[23], x3[23], java.lang.Object(LinkedList(42, x1[23])))≥8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])∧(U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥))

We simplified constraint (1753) using rule (III) which results in the following new constraint:
(1754)    (6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), java.lang.Object(LinkedList(42, x1[23])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), java.lang.Object(LinkedList(42, x1[23])))≥8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[7])), java.lang.Object(LinkedList(x0[7], x3[7])), x1[23])∧(U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥))

We simplified constraint (1754) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1755)    ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧[253 + (-1)bso_102] + [2]x1[23] ≥ 0)

We simplified constraint (1755) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1756)    ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧[253 + (-1)bso_102] + [2]x1[23] ≥ 0)

We simplified constraint (1756) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1757)    ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧[253 + (-1)bso_102] + [2]x1[23] ≥ 0)

We simplified constraint (1757) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1758)    ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[253 + (-1)bso_102] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8]))) → 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8]), 6432_0_TOPOSTFIX_NULL(x2[23], x3[23], java.lang.Object(LinkedList(42, x1[23]))) → 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23]) which results in the following constraint:
(1759)    (x2[8]=x2[23]∧x3[8]=x3[23]∧x1[8]=java.lang.Object(LinkedList(42, x1[23])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[23], x3[23], java.lang.Object(LinkedList(42, x1[23])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[23], x3[23], java.lang.Object(LinkedList(42, x1[23])))≥8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])∧(U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥))

We simplified constraint (1759) using rule (III) which results in the following new constraint:
(1760)    (6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(42, x1[23])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(42, x1[23])))≥8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[8])), x3[8], x1[23])∧(U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥))

We simplified constraint (1760) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1761)    ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧[253 + (-1)bso_102] + [2]x1[23] ≥ 0)

We simplified constraint (1761) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1762)    ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧[253 + (-1)bso_102] + [2]x1[23] ≥ 0)

We simplified constraint (1762) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1763)    ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧[253 + (-1)bso_102] + [2]x1[23] ≥ 0)

We simplified constraint (1763) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1764)    ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧0 ≥ 0∧0 ≥ 0∧[253 + (-1)bso_102] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9]))) → 6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9]), 6432_0_TOPOSTFIX_NULL(x2[23], x3[23], java.lang.Object(LinkedList(42, x1[23]))) → 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23]) which results in the following constraint:
(1765)    (x3[9]=x2[23]∧java.lang.Object(LinkedList(x2[9], x4[9]))=x3[23]∧x1[9]=java.lang.Object(LinkedList(42, x1[23])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[23], x3[23], java.lang.Object(LinkedList(42, x1[23])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[23], x3[23], java.lang.Object(LinkedList(42, x1[23])))≥8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])∧(U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥))

We simplified constraint (1765) using rule (III) which results in the following new constraint:
(1766)    (6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), java.lang.Object(LinkedList(42, x1[23])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), java.lang.Object(LinkedList(42, x1[23])))≥8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x3[9])), java.lang.Object(LinkedList(x2[9], x4[9])), x1[23])∧(U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥))

We simplified constraint (1766) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1767)    ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧[253 + (-1)bso_102] + [2]x1[23] ≥ 0)

We simplified constraint (1767) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1768)    ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧[253 + (-1)bso_102] + [2]x1[23] ≥ 0)

We simplified constraint (1768) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1769)    ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧[253 + (-1)bso_102] + [2]x1[23] ≥ 0)

We simplified constraint (1769) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1770)    ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[253 + (-1)bso_102] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10]), 6432_0_TOPOSTFIX_NULL(x2[23], x3[23], java.lang.Object(LinkedList(42, x1[23]))) → 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23]) which results in the following constraint:
(1771)    (java.lang.Object(LinkedList(42, x2[10]))=x2[23]∧x3[10]=x3[23]∧x1[10]=java.lang.Object(LinkedList(42, x1[23])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[23], x3[23], java.lang.Object(LinkedList(42, x1[23])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[23], x3[23], java.lang.Object(LinkedList(42, x1[23])))≥8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])∧(U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥))

We simplified constraint (1771) using rule (III) which results in the following new constraint:
(1772)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], java.lang.Object(LinkedList(42, x1[23])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], java.lang.Object(LinkedList(42, x1[23])))≥8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, java.lang.Object(LinkedList(42, x2[10])))), x3[10], x1[23])∧(U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥))

We simplified constraint (1772) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1773)    ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧[253 + (-1)bso_102] + [2]x1[23] ≥ 0)

We simplified constraint (1773) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1774)    ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧[253 + (-1)bso_102] + [2]x1[23] ≥ 0)

We simplified constraint (1774) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1775)    ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧[253 + (-1)bso_102] + [2]x1[23] ≥ 0)

We simplified constraint (1775) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1776)    ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧0 ≥ 0∧0 ≥ 0∧[253 + (-1)bso_102] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11]), 6432_0_TOPOSTFIX_NULL(x2[23], x3[23], java.lang.Object(LinkedList(42, x1[23]))) → 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23]) which results in the following constraint:
(1777)    (java.lang.Object(LinkedList(43, x2[11]))=x2[23]∧x3[11]=x3[23]∧x1[11]=java.lang.Object(LinkedList(42, x1[23])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[23], x3[23], java.lang.Object(LinkedList(42, x1[23])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[23], x3[23], java.lang.Object(LinkedList(42, x1[23])))≥8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])∧(U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥))

We simplified constraint (1777) using rule (III) which results in the following new constraint:
(1778)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], java.lang.Object(LinkedList(42, x1[23])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], java.lang.Object(LinkedList(42, x1[23])))≥8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, java.lang.Object(LinkedList(43, x2[11])))), x3[11], x1[23])∧(U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥))

We simplified constraint (1778) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1779)    ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧[253 + (-1)bso_102] + [2]x1[23] ≥ 0)

We simplified constraint (1779) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1780)    ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧[253 + (-1)bso_102] + [2]x1[23] ≥ 0)

We simplified constraint (1780) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1781)    ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧[253 + (-1)bso_102] + [2]x1[23] ≥ 0)

We simplified constraint (1781) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1782)    ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧0 ≥ 0∧0 ≥ 0∧[253 + (-1)bso_102] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12]))) → 6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12]), 6432_0_TOPOSTFIX_NULL(x2[23], x3[23], java.lang.Object(LinkedList(42, x1[23]))) → 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23]) which results in the following constraint:
(1783)    (x2[12]=x2[23]∧java.lang.Object(LinkedList(44, x3[12]))=x3[23]∧x1[12]=java.lang.Object(LinkedList(42, x1[23])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[23], x3[23], java.lang.Object(LinkedList(42, x1[23])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[23], x3[23], java.lang.Object(LinkedList(42, x1[23])))≥8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])∧(U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥))

We simplified constraint (1783) using rule (III) which results in the following new constraint:
(1784)    (6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), java.lang.Object(LinkedList(42, x1[23])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), java.lang.Object(LinkedList(42, x1[23])))≥8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[12])), java.lang.Object(LinkedList(44, x3[12])), x1[23])∧(U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥))

We simplified constraint (1784) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1785)    ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧[253 + (-1)bso_102] + [2]x1[23] ≥ 0)

We simplified constraint (1785) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1786)    ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧[253 + (-1)bso_102] + [2]x1[23] ≥ 0)

We simplified constraint (1786) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1787)    ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧[253 + (-1)bso_102] + [2]x1[23] ≥ 0)

We simplified constraint (1787) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1788)    ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧0 ≥ 0∧0 ≥ 0∧[253 + (-1)bso_102] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13]), 6432_0_TOPOSTFIX_NULL(x2[23], x3[23], java.lang.Object(LinkedList(42, x1[23]))) → 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23]) which results in the following constraint:
(1789)    (java.lang.Object(LinkedList(45, x2[13]))=x2[23]∧x3[13]=x3[23]∧x1[13]=java.lang.Object(LinkedList(42, x1[23])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[23], x3[23], java.lang.Object(LinkedList(42, x1[23])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[23], x3[23], java.lang.Object(LinkedList(42, x1[23])))≥8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])∧(U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥))

We simplified constraint (1789) using rule (III) which results in the following new constraint:
(1790)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], java.lang.Object(LinkedList(42, x1[23])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], java.lang.Object(LinkedList(42, x1[23])))≥8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, java.lang.Object(LinkedList(45, x2[13])))), x3[13], x1[23])∧(U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥))

We simplified constraint (1790) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1791)    ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧[253 + (-1)bso_102] + [2]x1[23] ≥ 0)

We simplified constraint (1791) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1792)    ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧[253 + (-1)bso_102] + [2]x1[23] ≥ 0)

We simplified constraint (1792) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1793)    ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧[253 + (-1)bso_102] + [2]x1[23] ≥ 0)

We simplified constraint (1793) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1794)    ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧0 ≥ 0∧0 ≥ 0∧[253 + (-1)bso_102] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14]))) → 6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14]), 6432_0_TOPOSTFIX_NULL(x2[23], x3[23], java.lang.Object(LinkedList(42, x1[23]))) → 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23]) which results in the following constraint:
(1795)    (x2[14]=x2[23]∧java.lang.Object(LinkedList(46, x3[14]))=x3[23]∧x1[14]=java.lang.Object(LinkedList(42, x1[23])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[23], x3[23], java.lang.Object(LinkedList(42, x1[23])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[23], x3[23], java.lang.Object(LinkedList(42, x1[23])))≥8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])∧(U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥))

We simplified constraint (1795) using rule (III) which results in the following new constraint:
(1796)    (6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), java.lang.Object(LinkedList(42, x1[23])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), java.lang.Object(LinkedList(42, x1[23])))≥8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[14])), java.lang.Object(LinkedList(46, x3[14])), x1[23])∧(U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥))

We simplified constraint (1796) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1797)    ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧[253 + (-1)bso_102] + [2]x1[23] ≥ 0)

We simplified constraint (1797) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1798)    ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧[253 + (-1)bso_102] + [2]x1[23] ≥ 0)

We simplified constraint (1798) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1799)    ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧[253 + (-1)bso_102] + [2]x1[23] ≥ 0)

We simplified constraint (1799) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1800)    ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧0 ≥ 0∧0 ≥ 0∧[253 + (-1)bso_102] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15]), 6432_0_TOPOSTFIX_NULL(x2[23], x3[23], java.lang.Object(LinkedList(42, x1[23]))) → 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23]) which results in the following constraint:
(1801)    (java.lang.Object(LinkedList(47, x2[15]))=x2[23]∧x3[15]=x3[23]∧x1[15]=java.lang.Object(LinkedList(42, x1[23])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[23], x3[23], java.lang.Object(LinkedList(42, x1[23])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[23], x3[23], java.lang.Object(LinkedList(42, x1[23])))≥8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])∧(U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥))

We simplified constraint (1801) using rule (III) which results in the following new constraint:
(1802)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], java.lang.Object(LinkedList(42, x1[23])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], java.lang.Object(LinkedList(42, x1[23])))≥8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, java.lang.Object(LinkedList(47, x2[15])))), x3[15], x1[23])∧(U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥))

We simplified constraint (1802) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1803)    ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧[253 + (-1)bso_102] + [2]x1[23] ≥ 0)

We simplified constraint (1803) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1804)    ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧[253 + (-1)bso_102] + [2]x1[23] ≥ 0)

We simplified constraint (1804) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1805)    ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧[253 + (-1)bso_102] + [2]x1[23] ≥ 0)

We simplified constraint (1805) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1806)    ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧0 ≥ 0∧0 ≥ 0∧[253 + (-1)bso_102] ≥ 0∧[1] ≥ 0)
We consider the chain 6715_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(44, x1[17])), x2[17], x3[17]) → 6432_0_TOPOSTFIX_NULL(x2[17], java.lang.Object(LinkedList(44, x3[17])), x1[17]), 6432_0_TOPOSTFIX_NULL(x2[23], x3[23], java.lang.Object(LinkedList(42, x1[23]))) → 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23]) which results in the following constraint:
(1807)    (x2[17]=x2[23]∧java.lang.Object(LinkedList(44, x3[17]))=x3[23]∧x1[17]=java.lang.Object(LinkedList(42, x1[23])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[23], x3[23], java.lang.Object(LinkedList(42, x1[23])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[23], x3[23], java.lang.Object(LinkedList(42, x1[23])))≥8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])∧(U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥))

We simplified constraint (1807) using rule (III) which results in the following new constraint:
(1808)    (6432_0_TOPOSTFIX_NULL(x2[17], java.lang.Object(LinkedList(44, x3[17])), java.lang.Object(LinkedList(42, x1[23])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[17], java.lang.Object(LinkedList(44, x3[17])), java.lang.Object(LinkedList(42, x1[23])))≥8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[17])), java.lang.Object(LinkedList(44, x3[17])), x1[23])∧(U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥))

We simplified constraint (1808) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1809)    ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧[253 + (-1)bso_102] + [2]x1[23] ≥ 0)

We simplified constraint (1809) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1810)    ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧[253 + (-1)bso_102] + [2]x1[23] ≥ 0)

We simplified constraint (1810) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1811)    ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧[253 + (-1)bso_102] + [2]x1[23] ≥ 0)

We simplified constraint (1811) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1812)    ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧0 ≥ 0∧0 ≥ 0∧[253 + (-1)bso_102] ≥ 0∧[1] ≥ 0)
We consider the chain 6725_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(46, x1[18])), x2[18], x3[18]) → 6432_0_TOPOSTFIX_NULL(x2[18], java.lang.Object(LinkedList(46, x3[18])), x1[18]), 6432_0_TOPOSTFIX_NULL(x2[23], x3[23], java.lang.Object(LinkedList(42, x1[23]))) → 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23]) which results in the following constraint:
(1813)    (x2[18]=x2[23]∧java.lang.Object(LinkedList(46, x3[18]))=x3[23]∧x1[18]=java.lang.Object(LinkedList(42, x1[23])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[23], x3[23], java.lang.Object(LinkedList(42, x1[23])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[23], x3[23], java.lang.Object(LinkedList(42, x1[23])))≥8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])∧(U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥))

We simplified constraint (1813) using rule (III) which results in the following new constraint:
(1814)    (6432_0_TOPOSTFIX_NULL(x2[18], java.lang.Object(LinkedList(46, x3[18])), java.lang.Object(LinkedList(42, x1[23])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[18], java.lang.Object(LinkedList(46, x3[18])), java.lang.Object(LinkedList(42, x1[23])))≥8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[18])), java.lang.Object(LinkedList(46, x3[18])), x1[23])∧(U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥))

We simplified constraint (1814) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1815)    ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧[253 + (-1)bso_102] + [2]x1[23] ≥ 0)

We simplified constraint (1815) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1816)    ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧[253 + (-1)bso_102] + [2]x1[23] ≥ 0)

We simplified constraint (1816) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1817)    ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧[253 + (-1)bso_102] + [2]x1[23] ≥ 0)

We simplified constraint (1817) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1818)    ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧0 ≥ 0∧0 ≥ 0∧[253 + (-1)bso_102] ≥ 0∧[1] ≥ 0)

For Pair 6432_0_TOPOSTFIX_NULL(x2, x3, java.lang.Object(LinkedList(43, x1))) → 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2)), x3, x1) the following chains were created:

We consider the chain 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0]) → 6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0]), 6432_0_TOPOSTFIX_NULL(x2[24], x3[24], java.lang.Object(LinkedList(43, x1[24]))) → 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24]) which results in the following constraint:
(1819)    (x0[0]=x2[24]∧x1[0]=x3[24]∧x2[0]=java.lang.Object(LinkedList(43, x1[24])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[24], x3[24], java.lang.Object(LinkedList(43, x1[24])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[24], x3[24], java.lang.Object(LinkedList(43, x1[24])))≥8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])∧(U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥))

We simplified constraint (1819) using rule (III) which results in the following new constraint:
(1820)    (6432_0_TOPOSTFIX_NULL(x0[0], x1[0], java.lang.Object(LinkedList(43, x1[24])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x0[0], x1[0], java.lang.Object(LinkedList(43, x1[24])))≥8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x0[0])), x1[0], x1[24])∧(U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥))

We simplified constraint (1820) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1821)    ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧[258 + (-1)bso_104] + [3]x1[24] ≥ 0)

We simplified constraint (1821) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1822)    ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧[258 + (-1)bso_104] + [3]x1[24] ≥ 0)

We simplified constraint (1822) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1823)    ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧[258 + (-1)bso_104] + [3]x1[24] ≥ 0)

We simplified constraint (1823) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1824)    ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧0 ≥ 0∧0 ≥ 0∧[258 + (-1)bso_104] ≥ 0∧[1] ≥ 0)
We consider the chain 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]) → 6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]), 6432_0_TOPOSTFIX_NULL(x2[24], x3[24], java.lang.Object(LinkedList(43, x1[24]))) → 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24]) which results in the following constraint:
(1825)    (x0[1]=x2[24]∧java.lang.Object(LinkedList(x1[1], x2[1]))=x3[24]∧x3[1]=java.lang.Object(LinkedList(43, x1[24])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[24], x3[24], java.lang.Object(LinkedList(43, x1[24])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[24], x3[24], java.lang.Object(LinkedList(43, x1[24])))≥8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])∧(U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥))

We simplified constraint (1825) using rule (III) which results in the following new constraint:
(1826)    (6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(43, x1[24])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(43, x1[24])))≥8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x0[1])), java.lang.Object(LinkedList(x1[1], x2[1])), x1[24])∧(U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥))

We simplified constraint (1826) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1827)    ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧[258 + (-1)bso_104] + [3]x1[24] ≥ 0)

We simplified constraint (1827) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1828)    ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧[258 + (-1)bso_104] + [3]x1[24] ≥ 0)

We simplified constraint (1828) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1829)    ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧[258 + (-1)bso_104] + [3]x1[24] ≥ 0)

We simplified constraint (1829) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1830)    ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[258 + (-1)bso_104] ≥ 0∧[1] ≥ 0)
We consider the chain 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]), 6432_0_TOPOSTFIX_NULL(x2[24], x3[24], java.lang.Object(LinkedList(43, x1[24]))) → 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24]) which results in the following constraint:
(1831)    (java.lang.Object(LinkedList(42, x1[2]))=x2[24]∧x2[2]=x3[24]∧x3[2]=java.lang.Object(LinkedList(43, x1[24])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[24], x3[24], java.lang.Object(LinkedList(43, x1[24])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[24], x3[24], java.lang.Object(LinkedList(43, x1[24])))≥8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])∧(U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥))

We simplified constraint (1831) using rule (III) which results in the following new constraint:
(1832)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(43, x1[24])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(43, x1[24])))≥8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, java.lang.Object(LinkedList(42, x1[2])))), x2[2], x1[24])∧(U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥))

We simplified constraint (1832) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1833)    ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧[258 + (-1)bso_104] + [3]x1[24] ≥ 0)

We simplified constraint (1833) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1834)    ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧[258 + (-1)bso_104] + [3]x1[24] ≥ 0)

We simplified constraint (1834) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1835)    ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧[258 + (-1)bso_104] + [3]x1[24] ≥ 0)

We simplified constraint (1835) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1836)    ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧0 ≥ 0∧0 ≥ 0∧[258 + (-1)bso_104] ≥ 0∧[1] ≥ 0)
We consider the chain 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]), 6432_0_TOPOSTFIX_NULL(x2[24], x3[24], java.lang.Object(LinkedList(43, x1[24]))) → 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24]) which results in the following constraint:
(1837)    (java.lang.Object(LinkedList(43, x1[3]))=x2[24]∧x2[3]=x3[24]∧x3[3]=java.lang.Object(LinkedList(43, x1[24])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[24], x3[24], java.lang.Object(LinkedList(43, x1[24])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[24], x3[24], java.lang.Object(LinkedList(43, x1[24])))≥8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])∧(U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥))

We simplified constraint (1837) using rule (III) which results in the following new constraint:
(1838)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(43, x1[24])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(43, x1[24])))≥8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, java.lang.Object(LinkedList(43, x1[3])))), x2[3], x1[24])∧(U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥))

We simplified constraint (1838) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1839)    ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧[258 + (-1)bso_104] + [3]x1[24] ≥ 0)

We simplified constraint (1839) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1840)    ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧[258 + (-1)bso_104] + [3]x1[24] ≥ 0)

We simplified constraint (1840) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1841)    ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧[258 + (-1)bso_104] + [3]x1[24] ≥ 0)

We simplified constraint (1841) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1842)    ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧0 ≥ 0∧0 ≥ 0∧[258 + (-1)bso_104] ≥ 0∧[1] ≥ 0)
We consider the chain 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]), 6432_0_TOPOSTFIX_NULL(x2[24], x3[24], java.lang.Object(LinkedList(43, x1[24]))) → 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24]) which results in the following constraint:
(1843)    (java.lang.Object(LinkedList(45, x1[4]))=x2[24]∧x2[4]=x3[24]∧x3[4]=java.lang.Object(LinkedList(43, x1[24])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[24], x3[24], java.lang.Object(LinkedList(43, x1[24])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[24], x3[24], java.lang.Object(LinkedList(43, x1[24])))≥8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])∧(U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥))

We simplified constraint (1843) using rule (III) which results in the following new constraint:
(1844)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(43, x1[24])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(43, x1[24])))≥8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, java.lang.Object(LinkedList(45, x1[4])))), x2[4], x1[24])∧(U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥))

We simplified constraint (1844) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1845)    ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧[258 + (-1)bso_104] + [3]x1[24] ≥ 0)

We simplified constraint (1845) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1846)    ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧[258 + (-1)bso_104] + [3]x1[24] ≥ 0)

We simplified constraint (1846) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1847)    ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧[258 + (-1)bso_104] + [3]x1[24] ≥ 0)

We simplified constraint (1847) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1848)    ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧0 ≥ 0∧0 ≥ 0∧[258 + (-1)bso_104] ≥ 0∧[1] ≥ 0)
We consider the chain 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]), 6432_0_TOPOSTFIX_NULL(x2[24], x3[24], java.lang.Object(LinkedList(43, x1[24]))) → 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24]) which results in the following constraint:
(1849)    (java.lang.Object(LinkedList(47, x1[5]))=x2[24]∧x2[5]=x3[24]∧x3[5]=java.lang.Object(LinkedList(43, x1[24])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[24], x3[24], java.lang.Object(LinkedList(43, x1[24])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[24], x3[24], java.lang.Object(LinkedList(43, x1[24])))≥8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])∧(U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥))

We simplified constraint (1849) using rule (III) which results in the following new constraint:
(1850)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(43, x1[24])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(43, x1[24])))≥8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, java.lang.Object(LinkedList(47, x1[5])))), x2[5], x1[24])∧(U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥))

We simplified constraint (1850) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1851)    ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧[258 + (-1)bso_104] + [3]x1[24] ≥ 0)

We simplified constraint (1851) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1852)    ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧[258 + (-1)bso_104] + [3]x1[24] ≥ 0)

We simplified constraint (1852) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1853)    ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧[258 + (-1)bso_104] + [3]x1[24] ≥ 0)

We simplified constraint (1853) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1854)    ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧0 ≥ 0∧0 ≥ 0∧[258 + (-1)bso_104] ≥ 0∧[1] ≥ 0)
We consider the chain COND_6432_0_TOPOSTFIX_NULL(TRUE, x2[7], x3[7], java.lang.Object(LinkedList(x0[7], x1[7]))) → 6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), x1[7]), 6432_0_TOPOSTFIX_NULL(x2[24], x3[24], java.lang.Object(LinkedList(43, x1[24]))) → 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24]) which results in the following constraint:
(1855)    (x2[7]=x2[24]∧java.lang.Object(LinkedList(x0[7], x3[7]))=x3[24]∧x1[7]=java.lang.Object(LinkedList(43, x1[24])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[24], x3[24], java.lang.Object(LinkedList(43, x1[24])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[24], x3[24], java.lang.Object(LinkedList(43, x1[24])))≥8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])∧(U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥))

We simplified constraint (1855) using rule (III) which results in the following new constraint:
(1856)    (6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), java.lang.Object(LinkedList(43, x1[24])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), java.lang.Object(LinkedList(43, x1[24])))≥8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[7])), java.lang.Object(LinkedList(x0[7], x3[7])), x1[24])∧(U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥))

We simplified constraint (1856) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1857)    ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧[258 + (-1)bso_104] + [3]x1[24] ≥ 0)

We simplified constraint (1857) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1858)    ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧[258 + (-1)bso_104] + [3]x1[24] ≥ 0)

We simplified constraint (1858) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1859)    ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧[258 + (-1)bso_104] + [3]x1[24] ≥ 0)

We simplified constraint (1859) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1860)    ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[258 + (-1)bso_104] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8]))) → 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8]), 6432_0_TOPOSTFIX_NULL(x2[24], x3[24], java.lang.Object(LinkedList(43, x1[24]))) → 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24]) which results in the following constraint:
(1861)    (x2[8]=x2[24]∧x3[8]=x3[24]∧x1[8]=java.lang.Object(LinkedList(43, x1[24])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[24], x3[24], java.lang.Object(LinkedList(43, x1[24])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[24], x3[24], java.lang.Object(LinkedList(43, x1[24])))≥8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])∧(U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥))

We simplified constraint (1861) using rule (III) which results in the following new constraint:
(1862)    (6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(43, x1[24])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(43, x1[24])))≥8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[8])), x3[8], x1[24])∧(U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥))

We simplified constraint (1862) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1863)    ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧[258 + (-1)bso_104] + [3]x1[24] ≥ 0)

We simplified constraint (1863) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1864)    ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧[258 + (-1)bso_104] + [3]x1[24] ≥ 0)

We simplified constraint (1864) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1865)    ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧[258 + (-1)bso_104] + [3]x1[24] ≥ 0)

We simplified constraint (1865) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1866)    ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧0 ≥ 0∧0 ≥ 0∧[258 + (-1)bso_104] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9]))) → 6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9]), 6432_0_TOPOSTFIX_NULL(x2[24], x3[24], java.lang.Object(LinkedList(43, x1[24]))) → 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24]) which results in the following constraint:
(1867)    (x3[9]=x2[24]∧java.lang.Object(LinkedList(x2[9], x4[9]))=x3[24]∧x1[9]=java.lang.Object(LinkedList(43, x1[24])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[24], x3[24], java.lang.Object(LinkedList(43, x1[24])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[24], x3[24], java.lang.Object(LinkedList(43, x1[24])))≥8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])∧(U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥))

We simplified constraint (1867) using rule (III) which results in the following new constraint:
(1868)    (6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), java.lang.Object(LinkedList(43, x1[24])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), java.lang.Object(LinkedList(43, x1[24])))≥8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x3[9])), java.lang.Object(LinkedList(x2[9], x4[9])), x1[24])∧(U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥))

We simplified constraint (1868) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1869)    ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧[258 + (-1)bso_104] + [3]x1[24] ≥ 0)

We simplified constraint (1869) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1870)    ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧[258 + (-1)bso_104] + [3]x1[24] ≥ 0)

We simplified constraint (1870) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1871)    ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧[258 + (-1)bso_104] + [3]x1[24] ≥ 0)

We simplified constraint (1871) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1872)    ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[258 + (-1)bso_104] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10]), 6432_0_TOPOSTFIX_NULL(x2[24], x3[24], java.lang.Object(LinkedList(43, x1[24]))) → 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24]) which results in the following constraint:
(1873)    (java.lang.Object(LinkedList(42, x2[10]))=x2[24]∧x3[10]=x3[24]∧x1[10]=java.lang.Object(LinkedList(43, x1[24])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[24], x3[24], java.lang.Object(LinkedList(43, x1[24])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[24], x3[24], java.lang.Object(LinkedList(43, x1[24])))≥8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])∧(U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥))

We simplified constraint (1873) using rule (III) which results in the following new constraint:
(1874)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], java.lang.Object(LinkedList(43, x1[24])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], java.lang.Object(LinkedList(43, x1[24])))≥8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, java.lang.Object(LinkedList(42, x2[10])))), x3[10], x1[24])∧(U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥))

We simplified constraint (1874) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1875)    ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧[258 + (-1)bso_104] + [3]x1[24] ≥ 0)

We simplified constraint (1875) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1876)    ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧[258 + (-1)bso_104] + [3]x1[24] ≥ 0)

We simplified constraint (1876) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1877)    ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧[258 + (-1)bso_104] + [3]x1[24] ≥ 0)

We simplified constraint (1877) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1878)    ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧0 ≥ 0∧0 ≥ 0∧[258 + (-1)bso_104] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11]), 6432_0_TOPOSTFIX_NULL(x2[24], x3[24], java.lang.Object(LinkedList(43, x1[24]))) → 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24]) which results in the following constraint:
(1879)    (java.lang.Object(LinkedList(43, x2[11]))=x2[24]∧x3[11]=x3[24]∧x1[11]=java.lang.Object(LinkedList(43, x1[24])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[24], x3[24], java.lang.Object(LinkedList(43, x1[24])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[24], x3[24], java.lang.Object(LinkedList(43, x1[24])))≥8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])∧(U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥))

We simplified constraint (1879) using rule (III) which results in the following new constraint:
(1880)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], java.lang.Object(LinkedList(43, x1[24])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], java.lang.Object(LinkedList(43, x1[24])))≥8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, java.lang.Object(LinkedList(43, x2[11])))), x3[11], x1[24])∧(U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥))

We simplified constraint (1880) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1881)    ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧[258 + (-1)bso_104] + [3]x1[24] ≥ 0)

We simplified constraint (1881) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1882)    ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧[258 + (-1)bso_104] + [3]x1[24] ≥ 0)

We simplified constraint (1882) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1883)    ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧[258 + (-1)bso_104] + [3]x1[24] ≥ 0)

We simplified constraint (1883) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1884)    ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧0 ≥ 0∧0 ≥ 0∧[258 + (-1)bso_104] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12]))) → 6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12]), 6432_0_TOPOSTFIX_NULL(x2[24], x3[24], java.lang.Object(LinkedList(43, x1[24]))) → 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24]) which results in the following constraint:
(1885)    (x2[12]=x2[24]∧java.lang.Object(LinkedList(44, x3[12]))=x3[24]∧x1[12]=java.lang.Object(LinkedList(43, x1[24])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[24], x3[24], java.lang.Object(LinkedList(43, x1[24])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[24], x3[24], java.lang.Object(LinkedList(43, x1[24])))≥8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])∧(U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥))

We simplified constraint (1885) using rule (III) which results in the following new constraint:
(1886)    (6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), java.lang.Object(LinkedList(43, x1[24])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), java.lang.Object(LinkedList(43, x1[24])))≥8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[12])), java.lang.Object(LinkedList(44, x3[12])), x1[24])∧(U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥))

We simplified constraint (1886) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1887)    ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧[258 + (-1)bso_104] + [3]x1[24] ≥ 0)

We simplified constraint (1887) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1888)    ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧[258 + (-1)bso_104] + [3]x1[24] ≥ 0)

We simplified constraint (1888) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1889)    ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧[258 + (-1)bso_104] + [3]x1[24] ≥ 0)

We simplified constraint (1889) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1890)    ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧0 ≥ 0∧0 ≥ 0∧[258 + (-1)bso_104] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13]), 6432_0_TOPOSTFIX_NULL(x2[24], x3[24], java.lang.Object(LinkedList(43, x1[24]))) → 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24]) which results in the following constraint:
(1891)    (java.lang.Object(LinkedList(45, x2[13]))=x2[24]∧x3[13]=x3[24]∧x1[13]=java.lang.Object(LinkedList(43, x1[24])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[24], x3[24], java.lang.Object(LinkedList(43, x1[24])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[24], x3[24], java.lang.Object(LinkedList(43, x1[24])))≥8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])∧(U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥))

We simplified constraint (1891) using rule (III) which results in the following new constraint:
(1892)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], java.lang.Object(LinkedList(43, x1[24])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], java.lang.Object(LinkedList(43, x1[24])))≥8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, java.lang.Object(LinkedList(45, x2[13])))), x3[13], x1[24])∧(U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥))

We simplified constraint (1892) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1893)    ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧[258 + (-1)bso_104] + [3]x1[24] ≥ 0)

We simplified constraint (1893) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1894)    ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧[258 + (-1)bso_104] + [3]x1[24] ≥ 0)

We simplified constraint (1894) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1895)    ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧[258 + (-1)bso_104] + [3]x1[24] ≥ 0)

We simplified constraint (1895) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1896)    ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧0 ≥ 0∧0 ≥ 0∧[258 + (-1)bso_104] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14]))) → 6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14]), 6432_0_TOPOSTFIX_NULL(x2[24], x3[24], java.lang.Object(LinkedList(43, x1[24]))) → 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24]) which results in the following constraint:
(1897)    (x2[14]=x2[24]∧java.lang.Object(LinkedList(46, x3[14]))=x3[24]∧x1[14]=java.lang.Object(LinkedList(43, x1[24])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[24], x3[24], java.lang.Object(LinkedList(43, x1[24])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[24], x3[24], java.lang.Object(LinkedList(43, x1[24])))≥8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])∧(U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥))

We simplified constraint (1897) using rule (III) which results in the following new constraint:
(1898)    (6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), java.lang.Object(LinkedList(43, x1[24])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), java.lang.Object(LinkedList(43, x1[24])))≥8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[14])), java.lang.Object(LinkedList(46, x3[14])), x1[24])∧(U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥))

We simplified constraint (1898) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1899)    ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧[258 + (-1)bso_104] + [3]x1[24] ≥ 0)

We simplified constraint (1899) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1900)    ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧[258 + (-1)bso_104] + [3]x1[24] ≥ 0)

We simplified constraint (1900) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1901)    ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧[258 + (-1)bso_104] + [3]x1[24] ≥ 0)

We simplified constraint (1901) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1902)    ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧0 ≥ 0∧0 ≥ 0∧[258 + (-1)bso_104] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15]), 6432_0_TOPOSTFIX_NULL(x2[24], x3[24], java.lang.Object(LinkedList(43, x1[24]))) → 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24]) which results in the following constraint:
(1903)    (java.lang.Object(LinkedList(47, x2[15]))=x2[24]∧x3[15]=x3[24]∧x1[15]=java.lang.Object(LinkedList(43, x1[24])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[24], x3[24], java.lang.Object(LinkedList(43, x1[24])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[24], x3[24], java.lang.Object(LinkedList(43, x1[24])))≥8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])∧(U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥))

We simplified constraint (1903) using rule (III) which results in the following new constraint:
(1904)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], java.lang.Object(LinkedList(43, x1[24])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], java.lang.Object(LinkedList(43, x1[24])))≥8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, java.lang.Object(LinkedList(47, x2[15])))), x3[15], x1[24])∧(U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥))

We simplified constraint (1904) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1905)    ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧[258 + (-1)bso_104] + [3]x1[24] ≥ 0)

We simplified constraint (1905) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1906)    ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧[258 + (-1)bso_104] + [3]x1[24] ≥ 0)

We simplified constraint (1906) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1907)    ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧[258 + (-1)bso_104] + [3]x1[24] ≥ 0)

We simplified constraint (1907) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1908)    ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧0 ≥ 0∧0 ≥ 0∧[258 + (-1)bso_104] ≥ 0∧[1] ≥ 0)
We consider the chain 6715_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(44, x1[17])), x2[17], x3[17]) → 6432_0_TOPOSTFIX_NULL(x2[17], java.lang.Object(LinkedList(44, x3[17])), x1[17]), 6432_0_TOPOSTFIX_NULL(x2[24], x3[24], java.lang.Object(LinkedList(43, x1[24]))) → 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24]) which results in the following constraint:
(1909)    (x2[17]=x2[24]∧java.lang.Object(LinkedList(44, x3[17]))=x3[24]∧x1[17]=java.lang.Object(LinkedList(43, x1[24])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[24], x3[24], java.lang.Object(LinkedList(43, x1[24])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[24], x3[24], java.lang.Object(LinkedList(43, x1[24])))≥8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])∧(U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥))

We simplified constraint (1909) using rule (III) which results in the following new constraint:
(1910)    (6432_0_TOPOSTFIX_NULL(x2[17], java.lang.Object(LinkedList(44, x3[17])), java.lang.Object(LinkedList(43, x1[24])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[17], java.lang.Object(LinkedList(44, x3[17])), java.lang.Object(LinkedList(43, x1[24])))≥8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[17])), java.lang.Object(LinkedList(44, x3[17])), x1[24])∧(U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥))

We simplified constraint (1910) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1911)    ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧[258 + (-1)bso_104] + [3]x1[24] ≥ 0)

We simplified constraint (1911) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1912)    ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧[258 + (-1)bso_104] + [3]x1[24] ≥ 0)

We simplified constraint (1912) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1913)    ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧[258 + (-1)bso_104] + [3]x1[24] ≥ 0)

We simplified constraint (1913) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1914)    ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧0 ≥ 0∧0 ≥ 0∧[258 + (-1)bso_104] ≥ 0∧[1] ≥ 0)
We consider the chain 6725_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(46, x1[18])), x2[18], x3[18]) → 6432_0_TOPOSTFIX_NULL(x2[18], java.lang.Object(LinkedList(46, x3[18])), x1[18]), 6432_0_TOPOSTFIX_NULL(x2[24], x3[24], java.lang.Object(LinkedList(43, x1[24]))) → 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24]) which results in the following constraint:
(1915)    (x2[18]=x2[24]∧java.lang.Object(LinkedList(46, x3[18]))=x3[24]∧x1[18]=java.lang.Object(LinkedList(43, x1[24])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[24], x3[24], java.lang.Object(LinkedList(43, x1[24])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[24], x3[24], java.lang.Object(LinkedList(43, x1[24])))≥8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])∧(U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥))

We simplified constraint (1915) using rule (III) which results in the following new constraint:
(1916)    (6432_0_TOPOSTFIX_NULL(x2[18], java.lang.Object(LinkedList(46, x3[18])), java.lang.Object(LinkedList(43, x1[24])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[18], java.lang.Object(LinkedList(46, x3[18])), java.lang.Object(LinkedList(43, x1[24])))≥8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[18])), java.lang.Object(LinkedList(46, x3[18])), x1[24])∧(U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥))

We simplified constraint (1916) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1917)    ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧[258 + (-1)bso_104] + [3]x1[24] ≥ 0)

We simplified constraint (1917) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1918)    ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧[258 + (-1)bso_104] + [3]x1[24] ≥ 0)

We simplified constraint (1918) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1919)    ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧[258 + (-1)bso_104] + [3]x1[24] ≥ 0)

We simplified constraint (1919) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1920)    ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧0 ≥ 0∧0 ≥ 0∧[258 + (-1)bso_104] ≥ 0∧[1] ≥ 0)

For Pair 6432_0_TOPOSTFIX_NULL(x2, x3, java.lang.Object(LinkedList(45, x1))) → 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2)), x3, x1) the following chains were created:

We consider the chain 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0]) → 6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0]), 6432_0_TOPOSTFIX_NULL(x2[25], x3[25], java.lang.Object(LinkedList(45, x1[25]))) → 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25]) which results in the following constraint:
(1921)    (x0[0]=x2[25]∧x1[0]=x3[25]∧x2[0]=java.lang.Object(LinkedList(45, x1[25])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[25], x3[25], java.lang.Object(LinkedList(45, x1[25])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[25], x3[25], java.lang.Object(LinkedList(45, x1[25])))≥8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])∧(U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥))

We simplified constraint (1921) using rule (III) which results in the following new constraint:
(1922)    (6432_0_TOPOSTFIX_NULL(x0[0], x1[0], java.lang.Object(LinkedList(45, x1[25])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x0[0], x1[0], java.lang.Object(LinkedList(45, x1[25])))≥8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x0[0])), x1[0], x1[25])∧(U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥))

We simplified constraint (1922) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1923)    ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧[272 + (-1)bso_106] + [3]x1[25] ≥ 0)

We simplified constraint (1923) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1924)    ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧[272 + (-1)bso_106] + [3]x1[25] ≥ 0)

We simplified constraint (1924) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1925)    ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧[272 + (-1)bso_106] + [3]x1[25] ≥ 0)

We simplified constraint (1925) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1926)    ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧0 ≥ 0∧0 ≥ 0∧[272 + (-1)bso_106] ≥ 0∧[1] ≥ 0)
We consider the chain 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]) → 6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]), 6432_0_TOPOSTFIX_NULL(x2[25], x3[25], java.lang.Object(LinkedList(45, x1[25]))) → 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25]) which results in the following constraint:
(1927)    (x0[1]=x2[25]∧java.lang.Object(LinkedList(x1[1], x2[1]))=x3[25]∧x3[1]=java.lang.Object(LinkedList(45, x1[25])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[25], x3[25], java.lang.Object(LinkedList(45, x1[25])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[25], x3[25], java.lang.Object(LinkedList(45, x1[25])))≥8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])∧(U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥))

We simplified constraint (1927) using rule (III) which results in the following new constraint:
(1928)    (6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(45, x1[25])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(45, x1[25])))≥8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x0[1])), java.lang.Object(LinkedList(x1[1], x2[1])), x1[25])∧(U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥))

We simplified constraint (1928) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1929)    ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧[272 + (-1)bso_106] + [3]x1[25] ≥ 0)

We simplified constraint (1929) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1930)    ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧[272 + (-1)bso_106] + [3]x1[25] ≥ 0)

We simplified constraint (1930) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1931)    ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧[272 + (-1)bso_106] + [3]x1[25] ≥ 0)

We simplified constraint (1931) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1932)    ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[272 + (-1)bso_106] ≥ 0∧[1] ≥ 0)
We consider the chain 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]), 6432_0_TOPOSTFIX_NULL(x2[25], x3[25], java.lang.Object(LinkedList(45, x1[25]))) → 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25]) which results in the following constraint:
(1933)    (java.lang.Object(LinkedList(42, x1[2]))=x2[25]∧x2[2]=x3[25]∧x3[2]=java.lang.Object(LinkedList(45, x1[25])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[25], x3[25], java.lang.Object(LinkedList(45, x1[25])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[25], x3[25], java.lang.Object(LinkedList(45, x1[25])))≥8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])∧(U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥))

We simplified constraint (1933) using rule (III) which results in the following new constraint:
(1934)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(45, x1[25])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(45, x1[25])))≥8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, java.lang.Object(LinkedList(42, x1[2])))), x2[2], x1[25])∧(U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥))

We simplified constraint (1934) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1935)    ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧[272 + (-1)bso_106] + [3]x1[25] ≥ 0)

We simplified constraint (1935) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1936)    ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧[272 + (-1)bso_106] + [3]x1[25] ≥ 0)

We simplified constraint (1936) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1937)    ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧[272 + (-1)bso_106] + [3]x1[25] ≥ 0)

We simplified constraint (1937) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1938)    ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧0 ≥ 0∧0 ≥ 0∧[272 + (-1)bso_106] ≥ 0∧[1] ≥ 0)
We consider the chain 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]), 6432_0_TOPOSTFIX_NULL(x2[25], x3[25], java.lang.Object(LinkedList(45, x1[25]))) → 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25]) which results in the following constraint:
(1939)    (java.lang.Object(LinkedList(43, x1[3]))=x2[25]∧x2[3]=x3[25]∧x3[3]=java.lang.Object(LinkedList(45, x1[25])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[25], x3[25], java.lang.Object(LinkedList(45, x1[25])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[25], x3[25], java.lang.Object(LinkedList(45, x1[25])))≥8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])∧(U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥))

We simplified constraint (1939) using rule (III) which results in the following new constraint:
(1940)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(45, x1[25])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(45, x1[25])))≥8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, java.lang.Object(LinkedList(43, x1[3])))), x2[3], x1[25])∧(U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥))

We simplified constraint (1940) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1941)    ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧[272 + (-1)bso_106] + [3]x1[25] ≥ 0)

We simplified constraint (1941) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1942)    ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧[272 + (-1)bso_106] + [3]x1[25] ≥ 0)

We simplified constraint (1942) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1943)    ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧[272 + (-1)bso_106] + [3]x1[25] ≥ 0)

We simplified constraint (1943) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1944)    ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧0 ≥ 0∧0 ≥ 0∧[272 + (-1)bso_106] ≥ 0∧[1] ≥ 0)
We consider the chain 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]), 6432_0_TOPOSTFIX_NULL(x2[25], x3[25], java.lang.Object(LinkedList(45, x1[25]))) → 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25]) which results in the following constraint:
(1945)    (java.lang.Object(LinkedList(45, x1[4]))=x2[25]∧x2[4]=x3[25]∧x3[4]=java.lang.Object(LinkedList(45, x1[25])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[25], x3[25], java.lang.Object(LinkedList(45, x1[25])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[25], x3[25], java.lang.Object(LinkedList(45, x1[25])))≥8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])∧(U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥))

We simplified constraint (1945) using rule (III) which results in the following new constraint:
(1946)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(45, x1[25])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(45, x1[25])))≥8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, java.lang.Object(LinkedList(45, x1[4])))), x2[4], x1[25])∧(U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥))

We simplified constraint (1946) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1947)    ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧[272 + (-1)bso_106] + [3]x1[25] ≥ 0)

We simplified constraint (1947) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1948)    ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧[272 + (-1)bso_106] + [3]x1[25] ≥ 0)

We simplified constraint (1948) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1949)    ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧[272 + (-1)bso_106] + [3]x1[25] ≥ 0)

We simplified constraint (1949) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1950)    ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧0 ≥ 0∧0 ≥ 0∧[272 + (-1)bso_106] ≥ 0∧[1] ≥ 0)
We consider the chain 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]), 6432_0_TOPOSTFIX_NULL(x2[25], x3[25], java.lang.Object(LinkedList(45, x1[25]))) → 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25]) which results in the following constraint:
(1951)    (java.lang.Object(LinkedList(47, x1[5]))=x2[25]∧x2[5]=x3[25]∧x3[5]=java.lang.Object(LinkedList(45, x1[25])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[25], x3[25], java.lang.Object(LinkedList(45, x1[25])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[25], x3[25], java.lang.Object(LinkedList(45, x1[25])))≥8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])∧(U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥))

We simplified constraint (1951) using rule (III) which results in the following new constraint:
(1952)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(45, x1[25])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(45, x1[25])))≥8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, java.lang.Object(LinkedList(47, x1[5])))), x2[5], x1[25])∧(U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥))

We simplified constraint (1952) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1953)    ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧[272 + (-1)bso_106] + [3]x1[25] ≥ 0)

We simplified constraint (1953) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1954)    ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧[272 + (-1)bso_106] + [3]x1[25] ≥ 0)

We simplified constraint (1954) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1955)    ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧[272 + (-1)bso_106] + [3]x1[25] ≥ 0)

We simplified constraint (1955) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1956)    ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧0 ≥ 0∧0 ≥ 0∧[272 + (-1)bso_106] ≥ 0∧[1] ≥ 0)
We consider the chain COND_6432_0_TOPOSTFIX_NULL(TRUE, x2[7], x3[7], java.lang.Object(LinkedList(x0[7], x1[7]))) → 6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), x1[7]), 6432_0_TOPOSTFIX_NULL(x2[25], x3[25], java.lang.Object(LinkedList(45, x1[25]))) → 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25]) which results in the following constraint:
(1957)    (x2[7]=x2[25]∧java.lang.Object(LinkedList(x0[7], x3[7]))=x3[25]∧x1[7]=java.lang.Object(LinkedList(45, x1[25])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[25], x3[25], java.lang.Object(LinkedList(45, x1[25])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[25], x3[25], java.lang.Object(LinkedList(45, x1[25])))≥8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])∧(U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥))

We simplified constraint (1957) using rule (III) which results in the following new constraint:
(1958)    (6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), java.lang.Object(LinkedList(45, x1[25])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), java.lang.Object(LinkedList(45, x1[25])))≥8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[7])), java.lang.Object(LinkedList(x0[7], x3[7])), x1[25])∧(U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥))

We simplified constraint (1958) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1959)    ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧[272 + (-1)bso_106] + [3]x1[25] ≥ 0)

We simplified constraint (1959) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1960)    ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧[272 + (-1)bso_106] + [3]x1[25] ≥ 0)

We simplified constraint (1960) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1961)    ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧[272 + (-1)bso_106] + [3]x1[25] ≥ 0)

We simplified constraint (1961) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1962)    ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[272 + (-1)bso_106] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8]))) → 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8]), 6432_0_TOPOSTFIX_NULL(x2[25], x3[25], java.lang.Object(LinkedList(45, x1[25]))) → 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25]) which results in the following constraint:
(1963)    (x2[8]=x2[25]∧x3[8]=x3[25]∧x1[8]=java.lang.Object(LinkedList(45, x1[25])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[25], x3[25], java.lang.Object(LinkedList(45, x1[25])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[25], x3[25], java.lang.Object(LinkedList(45, x1[25])))≥8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])∧(U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥))

We simplified constraint (1963) using rule (III) which results in the following new constraint:
(1964)    (6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(45, x1[25])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(45, x1[25])))≥8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[8])), x3[8], x1[25])∧(U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥))

We simplified constraint (1964) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1965)    ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧[272 + (-1)bso_106] + [3]x1[25] ≥ 0)

We simplified constraint (1965) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1966)    ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧[272 + (-1)bso_106] + [3]x1[25] ≥ 0)

We simplified constraint (1966) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1967)    ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧[272 + (-1)bso_106] + [3]x1[25] ≥ 0)

We simplified constraint (1967) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1968)    ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧0 ≥ 0∧0 ≥ 0∧[272 + (-1)bso_106] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9]))) → 6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9]), 6432_0_TOPOSTFIX_NULL(x2[25], x3[25], java.lang.Object(LinkedList(45, x1[25]))) → 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25]) which results in the following constraint:
(1969)    (x3[9]=x2[25]∧java.lang.Object(LinkedList(x2[9], x4[9]))=x3[25]∧x1[9]=java.lang.Object(LinkedList(45, x1[25])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[25], x3[25], java.lang.Object(LinkedList(45, x1[25])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[25], x3[25], java.lang.Object(LinkedList(45, x1[25])))≥8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])∧(U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥))

We simplified constraint (1969) using rule (III) which results in the following new constraint:
(1970)    (6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), java.lang.Object(LinkedList(45, x1[25])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), java.lang.Object(LinkedList(45, x1[25])))≥8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x3[9])), java.lang.Object(LinkedList(x2[9], x4[9])), x1[25])∧(U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥))

We simplified constraint (1970) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1971)    ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧[272 + (-1)bso_106] + [3]x1[25] ≥ 0)

We simplified constraint (1971) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1972)    ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧[272 + (-1)bso_106] + [3]x1[25] ≥ 0)

We simplified constraint (1972) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1973)    ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧[272 + (-1)bso_106] + [3]x1[25] ≥ 0)

We simplified constraint (1973) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1974)    ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[272 + (-1)bso_106] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10]), 6432_0_TOPOSTFIX_NULL(x2[25], x3[25], java.lang.Object(LinkedList(45, x1[25]))) → 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25]) which results in the following constraint:
(1975)    (java.lang.Object(LinkedList(42, x2[10]))=x2[25]∧x3[10]=x3[25]∧x1[10]=java.lang.Object(LinkedList(45, x1[25])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[25], x3[25], java.lang.Object(LinkedList(45, x1[25])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[25], x3[25], java.lang.Object(LinkedList(45, x1[25])))≥8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])∧(U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥))

We simplified constraint (1975) using rule (III) which results in the following new constraint:
(1976)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], java.lang.Object(LinkedList(45, x1[25])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], java.lang.Object(LinkedList(45, x1[25])))≥8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, java.lang.Object(LinkedList(42, x2[10])))), x3[10], x1[25])∧(U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥))

We simplified constraint (1976) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1977)    ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧[272 + (-1)bso_106] + [3]x1[25] ≥ 0)

We simplified constraint (1977) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1978)    ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧[272 + (-1)bso_106] + [3]x1[25] ≥ 0)

We simplified constraint (1978) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1979)    ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧[272 + (-1)bso_106] + [3]x1[25] ≥ 0)

We simplified constraint (1979) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1980)    ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧0 ≥ 0∧0 ≥ 0∧[272 + (-1)bso_106] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11]), 6432_0_TOPOSTFIX_NULL(x2[25], x3[25], java.lang.Object(LinkedList(45, x1[25]))) → 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25]) which results in the following constraint:
(1981)    (java.lang.Object(LinkedList(43, x2[11]))=x2[25]∧x3[11]=x3[25]∧x1[11]=java.lang.Object(LinkedList(45, x1[25])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[25], x3[25], java.lang.Object(LinkedList(45, x1[25])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[25], x3[25], java.lang.Object(LinkedList(45, x1[25])))≥8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])∧(U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥))

We simplified constraint (1981) using rule (III) which results in the following new constraint:
(1982)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], java.lang.Object(LinkedList(45, x1[25])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], java.lang.Object(LinkedList(45, x1[25])))≥8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, java.lang.Object(LinkedList(43, x2[11])))), x3[11], x1[25])∧(U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥))

We simplified constraint (1982) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1983)    ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧[272 + (-1)bso_106] + [3]x1[25] ≥ 0)

We simplified constraint (1983) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1984)    ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧[272 + (-1)bso_106] + [3]x1[25] ≥ 0)

We simplified constraint (1984) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1985)    ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧[272 + (-1)bso_106] + [3]x1[25] ≥ 0)

We simplified constraint (1985) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1986)    ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧0 ≥ 0∧0 ≥ 0∧[272 + (-1)bso_106] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12]))) → 6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12]), 6432_0_TOPOSTFIX_NULL(x2[25], x3[25], java.lang.Object(LinkedList(45, x1[25]))) → 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25]) which results in the following constraint:
(1987)    (x2[12]=x2[25]∧java.lang.Object(LinkedList(44, x3[12]))=x3[25]∧x1[12]=java.lang.Object(LinkedList(45, x1[25])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[25], x3[25], java.lang.Object(LinkedList(45, x1[25])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[25], x3[25], java.lang.Object(LinkedList(45, x1[25])))≥8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])∧(U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥))

We simplified constraint (1987) using rule (III) which results in the following new constraint:
(1988)    (6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), java.lang.Object(LinkedList(45, x1[25])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), java.lang.Object(LinkedList(45, x1[25])))≥8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[12])), java.lang.Object(LinkedList(44, x3[12])), x1[25])∧(U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥))

We simplified constraint (1988) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1989)    ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧[272 + (-1)bso_106] + [3]x1[25] ≥ 0)

We simplified constraint (1989) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1990)    ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧[272 + (-1)bso_106] + [3]x1[25] ≥ 0)

We simplified constraint (1990) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1991)    ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧[272 + (-1)bso_106] + [3]x1[25] ≥ 0)

We simplified constraint (1991) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1992)    ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧0 ≥ 0∧0 ≥ 0∧[272 + (-1)bso_106] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13]), 6432_0_TOPOSTFIX_NULL(x2[25], x3[25], java.lang.Object(LinkedList(45, x1[25]))) → 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25]) which results in the following constraint:
(1993)    (java.lang.Object(LinkedList(45, x2[13]))=x2[25]∧x3[13]=x3[25]∧x1[13]=java.lang.Object(LinkedList(45, x1[25])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[25], x3[25], java.lang.Object(LinkedList(45, x1[25])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[25], x3[25], java.lang.Object(LinkedList(45, x1[25])))≥8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])∧(U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥))

We simplified constraint (1993) using rule (III) which results in the following new constraint:
(1994)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], java.lang.Object(LinkedList(45, x1[25])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], java.lang.Object(LinkedList(45, x1[25])))≥8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, java.lang.Object(LinkedList(45, x2[13])))), x3[13], x1[25])∧(U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥))

We simplified constraint (1994) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(1995)    ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧[272 + (-1)bso_106] + [3]x1[25] ≥ 0)

We simplified constraint (1995) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(1996)    ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧[272 + (-1)bso_106] + [3]x1[25] ≥ 0)

We simplified constraint (1996) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(1997)    ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧[272 + (-1)bso_106] + [3]x1[25] ≥ 0)

We simplified constraint (1997) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(1998)    ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧0 ≥ 0∧0 ≥ 0∧[272 + (-1)bso_106] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14]))) → 6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14]), 6432_0_TOPOSTFIX_NULL(x2[25], x3[25], java.lang.Object(LinkedList(45, x1[25]))) → 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25]) which results in the following constraint:
(1999)    (x2[14]=x2[25]∧java.lang.Object(LinkedList(46, x3[14]))=x3[25]∧x1[14]=java.lang.Object(LinkedList(45, x1[25])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[25], x3[25], java.lang.Object(LinkedList(45, x1[25])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[25], x3[25], java.lang.Object(LinkedList(45, x1[25])))≥8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])∧(U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥))

We simplified constraint (1999) using rule (III) which results in the following new constraint:
(2000)    (6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), java.lang.Object(LinkedList(45, x1[25])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), java.lang.Object(LinkedList(45, x1[25])))≥8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[14])), java.lang.Object(LinkedList(46, x3[14])), x1[25])∧(U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥))

We simplified constraint (2000) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(2001)    ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧[272 + (-1)bso_106] + [3]x1[25] ≥ 0)

We simplified constraint (2001) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(2002)    ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧[272 + (-1)bso_106] + [3]x1[25] ≥ 0)

We simplified constraint (2002) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(2003)    ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧[272 + (-1)bso_106] + [3]x1[25] ≥ 0)

We simplified constraint (2003) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(2004)    ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧0 ≥ 0∧0 ≥ 0∧[272 + (-1)bso_106] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15]), 6432_0_TOPOSTFIX_NULL(x2[25], x3[25], java.lang.Object(LinkedList(45, x1[25]))) → 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25]) which results in the following constraint:
(2005)    (java.lang.Object(LinkedList(47, x2[15]))=x2[25]∧x3[15]=x3[25]∧x1[15]=java.lang.Object(LinkedList(45, x1[25])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[25], x3[25], java.lang.Object(LinkedList(45, x1[25])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[25], x3[25], java.lang.Object(LinkedList(45, x1[25])))≥8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])∧(U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥))

We simplified constraint (2005) using rule (III) which results in the following new constraint:
(2006)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], java.lang.Object(LinkedList(45, x1[25])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], java.lang.Object(LinkedList(45, x1[25])))≥8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, java.lang.Object(LinkedList(47, x2[15])))), x3[15], x1[25])∧(U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥))

We simplified constraint (2006) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(2007)    ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧[272 + (-1)bso_106] + [3]x1[25] ≥ 0)

We simplified constraint (2007) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(2008)    ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧[272 + (-1)bso_106] + [3]x1[25] ≥ 0)

We simplified constraint (2008) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(2009)    ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧[272 + (-1)bso_106] + [3]x1[25] ≥ 0)

We simplified constraint (2009) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(2010)    ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧0 ≥ 0∧0 ≥ 0∧[272 + (-1)bso_106] ≥ 0∧[1] ≥ 0)
We consider the chain 6715_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(44, x1[17])), x2[17], x3[17]) → 6432_0_TOPOSTFIX_NULL(x2[17], java.lang.Object(LinkedList(44, x3[17])), x1[17]), 6432_0_TOPOSTFIX_NULL(x2[25], x3[25], java.lang.Object(LinkedList(45, x1[25]))) → 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25]) which results in the following constraint:
(2011)    (x2[17]=x2[25]∧java.lang.Object(LinkedList(44, x3[17]))=x3[25]∧x1[17]=java.lang.Object(LinkedList(45, x1[25])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[25], x3[25], java.lang.Object(LinkedList(45, x1[25])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[25], x3[25], java.lang.Object(LinkedList(45, x1[25])))≥8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])∧(U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥))

We simplified constraint (2011) using rule (III) which results in the following new constraint:
(2012)    (6432_0_TOPOSTFIX_NULL(x2[17], java.lang.Object(LinkedList(44, x3[17])), java.lang.Object(LinkedList(45, x1[25])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[17], java.lang.Object(LinkedList(44, x3[17])), java.lang.Object(LinkedList(45, x1[25])))≥8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[17])), java.lang.Object(LinkedList(44, x3[17])), x1[25])∧(U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥))

We simplified constraint (2012) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(2013)    ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧[272 + (-1)bso_106] + [3]x1[25] ≥ 0)

We simplified constraint (2013) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(2014)    ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧[272 + (-1)bso_106] + [3]x1[25] ≥ 0)

We simplified constraint (2014) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(2015)    ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧[272 + (-1)bso_106] + [3]x1[25] ≥ 0)

We simplified constraint (2015) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(2016)    ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧0 ≥ 0∧0 ≥ 0∧[272 + (-1)bso_106] ≥ 0∧[1] ≥ 0)
We consider the chain 6725_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(46, x1[18])), x2[18], x3[18]) → 6432_0_TOPOSTFIX_NULL(x2[18], java.lang.Object(LinkedList(46, x3[18])), x1[18]), 6432_0_TOPOSTFIX_NULL(x2[25], x3[25], java.lang.Object(LinkedList(45, x1[25]))) → 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25]) which results in the following constraint:
(2017)    (x2[18]=x2[25]∧java.lang.Object(LinkedList(46, x3[18]))=x3[25]∧x1[18]=java.lang.Object(LinkedList(45, x1[25])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[25], x3[25], java.lang.Object(LinkedList(45, x1[25])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[25], x3[25], java.lang.Object(LinkedList(45, x1[25])))≥8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])∧(U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥))

We simplified constraint (2017) using rule (III) which results in the following new constraint:
(2018)    (6432_0_TOPOSTFIX_NULL(x2[18], java.lang.Object(LinkedList(46, x3[18])), java.lang.Object(LinkedList(45, x1[25])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[18], java.lang.Object(LinkedList(46, x3[18])), java.lang.Object(LinkedList(45, x1[25])))≥8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[18])), java.lang.Object(LinkedList(46, x3[18])), x1[25])∧(U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥))

We simplified constraint (2018) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(2019)    ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧[272 + (-1)bso_106] + [3]x1[25] ≥ 0)

We simplified constraint (2019) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(2020)    ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧[272 + (-1)bso_106] + [3]x1[25] ≥ 0)

We simplified constraint (2020) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(2021)    ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧[272 + (-1)bso_106] + [3]x1[25] ≥ 0)

We simplified constraint (2021) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(2022)    ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧0 ≥ 0∧0 ≥ 0∧[272 + (-1)bso_106] ≥ 0∧[1] ≥ 0)

For Pair 6432_0_TOPOSTFIX_NULL(x2, x3, java.lang.Object(LinkedList(47, x1))) → 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2)), x3, x1) the following chains were created:

We consider the chain 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0]) → 6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0]), 6432_0_TOPOSTFIX_NULL(x2[26], x3[26], java.lang.Object(LinkedList(47, x1[26]))) → 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26]) which results in the following constraint:
(2023)    (x0[0]=x2[26]∧x1[0]=x3[26]∧x2[0]=java.lang.Object(LinkedList(47, x1[26])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[26], x3[26], java.lang.Object(LinkedList(47, x1[26])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[26], x3[26], java.lang.Object(LinkedList(47, x1[26])))≥8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])∧(U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥))

We simplified constraint (2023) using rule (III) which results in the following new constraint:
(2024)    (6432_0_TOPOSTFIX_NULL(x0[0], x1[0], java.lang.Object(LinkedList(47, x1[26])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x0[0], x1[0], java.lang.Object(LinkedList(47, x1[26])))≥8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x0[0])), x1[0], x1[26])∧(U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥))

We simplified constraint (2024) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(2025)    ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧[284 + (-1)bso_108] + [3]x1[26] ≥ 0)

We simplified constraint (2025) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(2026)    ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧[284 + (-1)bso_108] + [3]x1[26] ≥ 0)

We simplified constraint (2026) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(2027)    ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧[284 + (-1)bso_108] + [3]x1[26] ≥ 0)

We simplified constraint (2027) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(2028)    ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧0 ≥ 0∧0 ≥ 0∧[284 + (-1)bso_108] ≥ 0∧[1] ≥ 0)
We consider the chain 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]) → 6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]), 6432_0_TOPOSTFIX_NULL(x2[26], x3[26], java.lang.Object(LinkedList(47, x1[26]))) → 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26]) which results in the following constraint:
(2029)    (x0[1]=x2[26]∧java.lang.Object(LinkedList(x1[1], x2[1]))=x3[26]∧x3[1]=java.lang.Object(LinkedList(47, x1[26])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[26], x3[26], java.lang.Object(LinkedList(47, x1[26])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[26], x3[26], java.lang.Object(LinkedList(47, x1[26])))≥8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])∧(U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥))

We simplified constraint (2029) using rule (III) which results in the following new constraint:
(2030)    (6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(47, x1[26])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(47, x1[26])))≥8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x0[1])), java.lang.Object(LinkedList(x1[1], x2[1])), x1[26])∧(U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥))

We simplified constraint (2030) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(2031)    ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧[284 + (-1)bso_108] + [3]x1[26] ≥ 0)

We simplified constraint (2031) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(2032)    ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧[284 + (-1)bso_108] + [3]x1[26] ≥ 0)

We simplified constraint (2032) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(2033)    ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧[284 + (-1)bso_108] + [3]x1[26] ≥ 0)

We simplified constraint (2033) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(2034)    ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[284 + (-1)bso_108] ≥ 0∧[1] ≥ 0)
We consider the chain 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]), 6432_0_TOPOSTFIX_NULL(x2[26], x3[26], java.lang.Object(LinkedList(47, x1[26]))) → 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26]) which results in the following constraint:
(2035)    (java.lang.Object(LinkedList(42, x1[2]))=x2[26]∧x2[2]=x3[26]∧x3[2]=java.lang.Object(LinkedList(47, x1[26])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[26], x3[26], java.lang.Object(LinkedList(47, x1[26])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[26], x3[26], java.lang.Object(LinkedList(47, x1[26])))≥8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])∧(U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥))

We simplified constraint (2035) using rule (III) which results in the following new constraint:
(2036)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(47, x1[26])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(47, x1[26])))≥8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, java.lang.Object(LinkedList(42, x1[2])))), x2[2], x1[26])∧(U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥))

We simplified constraint (2036) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(2037)    ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧[284 + (-1)bso_108] + [3]x1[26] ≥ 0)

We simplified constraint (2037) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(2038)    ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧[284 + (-1)bso_108] + [3]x1[26] ≥ 0)

We simplified constraint (2038) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(2039)    ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧[284 + (-1)bso_108] + [3]x1[26] ≥ 0)

We simplified constraint (2039) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(2040)    ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧0 ≥ 0∧0 ≥ 0∧[284 + (-1)bso_108] ≥ 0∧[1] ≥ 0)
We consider the chain 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]), 6432_0_TOPOSTFIX_NULL(x2[26], x3[26], java.lang.Object(LinkedList(47, x1[26]))) → 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26]) which results in the following constraint:
(2041)    (java.lang.Object(LinkedList(43, x1[3]))=x2[26]∧x2[3]=x3[26]∧x3[3]=java.lang.Object(LinkedList(47, x1[26])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[26], x3[26], java.lang.Object(LinkedList(47, x1[26])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[26], x3[26], java.lang.Object(LinkedList(47, x1[26])))≥8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])∧(U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥))

We simplified constraint (2041) using rule (III) which results in the following new constraint:
(2042)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(47, x1[26])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(47, x1[26])))≥8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, java.lang.Object(LinkedList(43, x1[3])))), x2[3], x1[26])∧(U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥))

We simplified constraint (2042) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(2043)    ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧[284 + (-1)bso_108] + [3]x1[26] ≥ 0)

We simplified constraint (2043) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(2044)    ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧[284 + (-1)bso_108] + [3]x1[26] ≥ 0)

We simplified constraint (2044) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(2045)    ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧[284 + (-1)bso_108] + [3]x1[26] ≥ 0)

We simplified constraint (2045) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(2046)    ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧0 ≥ 0∧0 ≥ 0∧[284 + (-1)bso_108] ≥ 0∧[1] ≥ 0)
We consider the chain 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]), 6432_0_TOPOSTFIX_NULL(x2[26], x3[26], java.lang.Object(LinkedList(47, x1[26]))) → 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26]) which results in the following constraint:
(2047)    (java.lang.Object(LinkedList(45, x1[4]))=x2[26]∧x2[4]=x3[26]∧x3[4]=java.lang.Object(LinkedList(47, x1[26])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[26], x3[26], java.lang.Object(LinkedList(47, x1[26])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[26], x3[26], java.lang.Object(LinkedList(47, x1[26])))≥8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])∧(U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥))

We simplified constraint (2047) using rule (III) which results in the following new constraint:
(2048)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(47, x1[26])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(47, x1[26])))≥8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, java.lang.Object(LinkedList(45, x1[4])))), x2[4], x1[26])∧(U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥))

We simplified constraint (2048) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(2049)    ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧[284 + (-1)bso_108] + [3]x1[26] ≥ 0)

We simplified constraint (2049) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(2050)    ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧[284 + (-1)bso_108] + [3]x1[26] ≥ 0)

We simplified constraint (2050) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(2051)    ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧[284 + (-1)bso_108] + [3]x1[26] ≥ 0)

We simplified constraint (2051) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(2052)    ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧0 ≥ 0∧0 ≥ 0∧[284 + (-1)bso_108] ≥ 0∧[1] ≥ 0)
We consider the chain 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]), 6432_0_TOPOSTFIX_NULL(x2[26], x3[26], java.lang.Object(LinkedList(47, x1[26]))) → 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26]) which results in the following constraint:
(2053)    (java.lang.Object(LinkedList(47, x1[5]))=x2[26]∧x2[5]=x3[26]∧x3[5]=java.lang.Object(LinkedList(47, x1[26])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[26], x3[26], java.lang.Object(LinkedList(47, x1[26])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[26], x3[26], java.lang.Object(LinkedList(47, x1[26])))≥8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])∧(U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥))

We simplified constraint (2053) using rule (III) which results in the following new constraint:
(2054)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(47, x1[26])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(47, x1[26])))≥8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, java.lang.Object(LinkedList(47, x1[5])))), x2[5], x1[26])∧(U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥))

We simplified constraint (2054) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(2055)    ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧[284 + (-1)bso_108] + [3]x1[26] ≥ 0)

We simplified constraint (2055) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(2056)    ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧[284 + (-1)bso_108] + [3]x1[26] ≥ 0)

We simplified constraint (2056) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(2057)    ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧[284 + (-1)bso_108] + [3]x1[26] ≥ 0)

We simplified constraint (2057) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(2058)    ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧0 ≥ 0∧0 ≥ 0∧[284 + (-1)bso_108] ≥ 0∧[1] ≥ 0)
We consider the chain COND_6432_0_TOPOSTFIX_NULL(TRUE, x2[7], x3[7], java.lang.Object(LinkedList(x0[7], x1[7]))) → 6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), x1[7]), 6432_0_TOPOSTFIX_NULL(x2[26], x3[26], java.lang.Object(LinkedList(47, x1[26]))) → 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26]) which results in the following constraint:
(2059)    (x2[7]=x2[26]∧java.lang.Object(LinkedList(x0[7], x3[7]))=x3[26]∧x1[7]=java.lang.Object(LinkedList(47, x1[26])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[26], x3[26], java.lang.Object(LinkedList(47, x1[26])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[26], x3[26], java.lang.Object(LinkedList(47, x1[26])))≥8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])∧(U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥))

We simplified constraint (2059) using rule (III) which results in the following new constraint:
(2060)    (6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), java.lang.Object(LinkedList(47, x1[26])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), java.lang.Object(LinkedList(47, x1[26])))≥8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[7])), java.lang.Object(LinkedList(x0[7], x3[7])), x1[26])∧(U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥))

We simplified constraint (2060) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(2061)    ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧[284 + (-1)bso_108] + [3]x1[26] ≥ 0)

We simplified constraint (2061) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(2062)    ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧[284 + (-1)bso_108] + [3]x1[26] ≥ 0)

We simplified constraint (2062) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(2063)    ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧[284 + (-1)bso_108] + [3]x1[26] ≥ 0)

We simplified constraint (2063) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(2064)    ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[284 + (-1)bso_108] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8]))) → 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8]), 6432_0_TOPOSTFIX_NULL(x2[26], x3[26], java.lang.Object(LinkedList(47, x1[26]))) → 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26]) which results in the following constraint:
(2065)    (x2[8]=x2[26]∧x3[8]=x3[26]∧x1[8]=java.lang.Object(LinkedList(47, x1[26])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[26], x3[26], java.lang.Object(LinkedList(47, x1[26])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[26], x3[26], java.lang.Object(LinkedList(47, x1[26])))≥8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])∧(U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥))

We simplified constraint (2065) using rule (III) which results in the following new constraint:
(2066)    (6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(47, x1[26])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(47, x1[26])))≥8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[8])), x3[8], x1[26])∧(U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥))

We simplified constraint (2066) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(2067)    ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧[284 + (-1)bso_108] + [3]x1[26] ≥ 0)

We simplified constraint (2067) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(2068)    ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧[284 + (-1)bso_108] + [3]x1[26] ≥ 0)

We simplified constraint (2068) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(2069)    ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧[284 + (-1)bso_108] + [3]x1[26] ≥ 0)

We simplified constraint (2069) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(2070)    ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧0 ≥ 0∧0 ≥ 0∧[284 + (-1)bso_108] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9]))) → 6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9]), 6432_0_TOPOSTFIX_NULL(x2[26], x3[26], java.lang.Object(LinkedList(47, x1[26]))) → 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26]) which results in the following constraint:
(2071)    (x3[9]=x2[26]∧java.lang.Object(LinkedList(x2[9], x4[9]))=x3[26]∧x1[9]=java.lang.Object(LinkedList(47, x1[26])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[26], x3[26], java.lang.Object(LinkedList(47, x1[26])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[26], x3[26], java.lang.Object(LinkedList(47, x1[26])))≥8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])∧(U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥))

We simplified constraint (2071) using rule (III) which results in the following new constraint:
(2072)    (6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), java.lang.Object(LinkedList(47, x1[26])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), java.lang.Object(LinkedList(47, x1[26])))≥8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x3[9])), java.lang.Object(LinkedList(x2[9], x4[9])), x1[26])∧(U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥))

We simplified constraint (2072) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(2073)    ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧[284 + (-1)bso_108] + [3]x1[26] ≥ 0)

We simplified constraint (2073) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(2074)    ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧[284 + (-1)bso_108] + [3]x1[26] ≥ 0)

We simplified constraint (2074) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(2075)    ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧[284 + (-1)bso_108] + [3]x1[26] ≥ 0)

We simplified constraint (2075) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(2076)    ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[284 + (-1)bso_108] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10]), 6432_0_TOPOSTFIX_NULL(x2[26], x3[26], java.lang.Object(LinkedList(47, x1[26]))) → 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26]) which results in the following constraint:
(2077)    (java.lang.Object(LinkedList(42, x2[10]))=x2[26]∧x3[10]=x3[26]∧x1[10]=java.lang.Object(LinkedList(47, x1[26])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[26], x3[26], java.lang.Object(LinkedList(47, x1[26])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[26], x3[26], java.lang.Object(LinkedList(47, x1[26])))≥8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])∧(U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥))

We simplified constraint (2077) using rule (III) which results in the following new constraint:
(2078)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], java.lang.Object(LinkedList(47, x1[26])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], java.lang.Object(LinkedList(47, x1[26])))≥8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, java.lang.Object(LinkedList(42, x2[10])))), x3[10], x1[26])∧(U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥))

We simplified constraint (2078) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(2079)    ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧[284 + (-1)bso_108] + [3]x1[26] ≥ 0)

We simplified constraint (2079) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(2080)    ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧[284 + (-1)bso_108] + [3]x1[26] ≥ 0)

We simplified constraint (2080) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(2081)    ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧[284 + (-1)bso_108] + [3]x1[26] ≥ 0)

We simplified constraint (2081) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(2082)    ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧0 ≥ 0∧0 ≥ 0∧[284 + (-1)bso_108] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11]), 6432_0_TOPOSTFIX_NULL(x2[26], x3[26], java.lang.Object(LinkedList(47, x1[26]))) → 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26]) which results in the following constraint:
(2083)    (java.lang.Object(LinkedList(43, x2[11]))=x2[26]∧x3[11]=x3[26]∧x1[11]=java.lang.Object(LinkedList(47, x1[26])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[26], x3[26], java.lang.Object(LinkedList(47, x1[26])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[26], x3[26], java.lang.Object(LinkedList(47, x1[26])))≥8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])∧(U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥))

We simplified constraint (2083) using rule (III) which results in the following new constraint:
(2084)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], java.lang.Object(LinkedList(47, x1[26])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], java.lang.Object(LinkedList(47, x1[26])))≥8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, java.lang.Object(LinkedList(43, x2[11])))), x3[11], x1[26])∧(U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥))

We simplified constraint (2084) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(2085)    ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧[284 + (-1)bso_108] + [3]x1[26] ≥ 0)

We simplified constraint (2085) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(2086)    ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧[284 + (-1)bso_108] + [3]x1[26] ≥ 0)

We simplified constraint (2086) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(2087)    ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧[284 + (-1)bso_108] + [3]x1[26] ≥ 0)

We simplified constraint (2087) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(2088)    ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧0 ≥ 0∧0 ≥ 0∧[284 + (-1)bso_108] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12]))) → 6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12]), 6432_0_TOPOSTFIX_NULL(x2[26], x3[26], java.lang.Object(LinkedList(47, x1[26]))) → 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26]) which results in the following constraint:
(2089)    (x2[12]=x2[26]∧java.lang.Object(LinkedList(44, x3[12]))=x3[26]∧x1[12]=java.lang.Object(LinkedList(47, x1[26])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[26], x3[26], java.lang.Object(LinkedList(47, x1[26])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[26], x3[26], java.lang.Object(LinkedList(47, x1[26])))≥8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])∧(U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥))

We simplified constraint (2089) using rule (III) which results in the following new constraint:
(2090)    (6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), java.lang.Object(LinkedList(47, x1[26])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), java.lang.Object(LinkedList(47, x1[26])))≥8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[12])), java.lang.Object(LinkedList(44, x3[12])), x1[26])∧(U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥))

We simplified constraint (2090) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(2091)    ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧[284 + (-1)bso_108] + [3]x1[26] ≥ 0)

We simplified constraint (2091) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(2092)    ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧[284 + (-1)bso_108] + [3]x1[26] ≥ 0)

We simplified constraint (2092) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(2093)    ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧[284 + (-1)bso_108] + [3]x1[26] ≥ 0)

We simplified constraint (2093) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(2094)    ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧0 ≥ 0∧0 ≥ 0∧[284 + (-1)bso_108] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13]), 6432_0_TOPOSTFIX_NULL(x2[26], x3[26], java.lang.Object(LinkedList(47, x1[26]))) → 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26]) which results in the following constraint:
(2095)    (java.lang.Object(LinkedList(45, x2[13]))=x2[26]∧x3[13]=x3[26]∧x1[13]=java.lang.Object(LinkedList(47, x1[26])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[26], x3[26], java.lang.Object(LinkedList(47, x1[26])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[26], x3[26], java.lang.Object(LinkedList(47, x1[26])))≥8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])∧(U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥))

We simplified constraint (2095) using rule (III) which results in the following new constraint:
(2096)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], java.lang.Object(LinkedList(47, x1[26])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], java.lang.Object(LinkedList(47, x1[26])))≥8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, java.lang.Object(LinkedList(45, x2[13])))), x3[13], x1[26])∧(U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥))

We simplified constraint (2096) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(2097)    ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧[284 + (-1)bso_108] + [3]x1[26] ≥ 0)

We simplified constraint (2097) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(2098)    ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧[284 + (-1)bso_108] + [3]x1[26] ≥ 0)

We simplified constraint (2098) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(2099)    ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧[284 + (-1)bso_108] + [3]x1[26] ≥ 0)

We simplified constraint (2099) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(2100)    ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧0 ≥ 0∧0 ≥ 0∧[284 + (-1)bso_108] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14]))) → 6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14]), 6432_0_TOPOSTFIX_NULL(x2[26], x3[26], java.lang.Object(LinkedList(47, x1[26]))) → 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26]) which results in the following constraint:
(2101)    (x2[14]=x2[26]∧java.lang.Object(LinkedList(46, x3[14]))=x3[26]∧x1[14]=java.lang.Object(LinkedList(47, x1[26])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[26], x3[26], java.lang.Object(LinkedList(47, x1[26])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[26], x3[26], java.lang.Object(LinkedList(47, x1[26])))≥8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])∧(U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥))

We simplified constraint (2101) using rule (III) which results in the following new constraint:
(2102)    (6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), java.lang.Object(LinkedList(47, x1[26])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), java.lang.Object(LinkedList(47, x1[26])))≥8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[14])), java.lang.Object(LinkedList(46, x3[14])), x1[26])∧(U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥))

We simplified constraint (2102) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(2103)    ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧[284 + (-1)bso_108] + [3]x1[26] ≥ 0)

We simplified constraint (2103) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(2104)    ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧[284 + (-1)bso_108] + [3]x1[26] ≥ 0)

We simplified constraint (2104) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(2105)    ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧[284 + (-1)bso_108] + [3]x1[26] ≥ 0)

We simplified constraint (2105) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(2106)    ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧0 ≥ 0∧0 ≥ 0∧[284 + (-1)bso_108] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15]), 6432_0_TOPOSTFIX_NULL(x2[26], x3[26], java.lang.Object(LinkedList(47, x1[26]))) → 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26]) which results in the following constraint:
(2107)    (java.lang.Object(LinkedList(47, x2[15]))=x2[26]∧x3[15]=x3[26]∧x1[15]=java.lang.Object(LinkedList(47, x1[26])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[26], x3[26], java.lang.Object(LinkedList(47, x1[26])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[26], x3[26], java.lang.Object(LinkedList(47, x1[26])))≥8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])∧(U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥))

We simplified constraint (2107) using rule (III) which results in the following new constraint:
(2108)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], java.lang.Object(LinkedList(47, x1[26])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], java.lang.Object(LinkedList(47, x1[26])))≥8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, java.lang.Object(LinkedList(47, x2[15])))), x3[15], x1[26])∧(U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥))

We simplified constraint (2108) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(2109)    ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧[284 + (-1)bso_108] + [3]x1[26] ≥ 0)

We simplified constraint (2109) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(2110)    ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧[284 + (-1)bso_108] + [3]x1[26] ≥ 0)

We simplified constraint (2110) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(2111)    ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧[284 + (-1)bso_108] + [3]x1[26] ≥ 0)

We simplified constraint (2111) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(2112)    ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧0 ≥ 0∧0 ≥ 0∧[284 + (-1)bso_108] ≥ 0∧[1] ≥ 0)
We consider the chain 6715_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(44, x1[17])), x2[17], x3[17]) → 6432_0_TOPOSTFIX_NULL(x2[17], java.lang.Object(LinkedList(44, x3[17])), x1[17]), 6432_0_TOPOSTFIX_NULL(x2[26], x3[26], java.lang.Object(LinkedList(47, x1[26]))) → 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26]) which results in the following constraint:
(2113)    (x2[17]=x2[26]∧java.lang.Object(LinkedList(44, x3[17]))=x3[26]∧x1[17]=java.lang.Object(LinkedList(47, x1[26])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[26], x3[26], java.lang.Object(LinkedList(47, x1[26])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[26], x3[26], java.lang.Object(LinkedList(47, x1[26])))≥8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])∧(U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥))

We simplified constraint (2113) using rule (III) which results in the following new constraint:
(2114)    (6432_0_TOPOSTFIX_NULL(x2[17], java.lang.Object(LinkedList(44, x3[17])), java.lang.Object(LinkedList(47, x1[26])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[17], java.lang.Object(LinkedList(44, x3[17])), java.lang.Object(LinkedList(47, x1[26])))≥8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[17])), java.lang.Object(LinkedList(44, x3[17])), x1[26])∧(U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥))

We simplified constraint (2114) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(2115)    ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧[284 + (-1)bso_108] + [3]x1[26] ≥ 0)

We simplified constraint (2115) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(2116)    ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧[284 + (-1)bso_108] + [3]x1[26] ≥ 0)

We simplified constraint (2116) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(2117)    ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧[284 + (-1)bso_108] + [3]x1[26] ≥ 0)

We simplified constraint (2117) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(2118)    ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧0 ≥ 0∧0 ≥ 0∧[284 + (-1)bso_108] ≥ 0∧[1] ≥ 0)
We consider the chain 6725_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(46, x1[18])), x2[18], x3[18]) → 6432_0_TOPOSTFIX_NULL(x2[18], java.lang.Object(LinkedList(46, x3[18])), x1[18]), 6432_0_TOPOSTFIX_NULL(x2[26], x3[26], java.lang.Object(LinkedList(47, x1[26]))) → 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26]) which results in the following constraint:
(2119)    (x2[18]=x2[26]∧java.lang.Object(LinkedList(46, x3[18]))=x3[26]∧x1[18]=java.lang.Object(LinkedList(47, x1[26])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[26], x3[26], java.lang.Object(LinkedList(47, x1[26])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[26], x3[26], java.lang.Object(LinkedList(47, x1[26])))≥8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])∧(U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥))

We simplified constraint (2119) using rule (III) which results in the following new constraint:
(2120)    (6432_0_TOPOSTFIX_NULL(x2[18], java.lang.Object(LinkedList(46, x3[18])), java.lang.Object(LinkedList(47, x1[26])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[18], java.lang.Object(LinkedList(46, x3[18])), java.lang.Object(LinkedList(47, x1[26])))≥8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[18])), java.lang.Object(LinkedList(46, x3[18])), x1[26])∧(U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥))

We simplified constraint (2120) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(2121)    ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧[284 + (-1)bso_108] + [3]x1[26] ≥ 0)

We simplified constraint (2121) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(2122)    ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧[284 + (-1)bso_108] + [3]x1[26] ≥ 0)

We simplified constraint (2122) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(2123)    ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧[284 + (-1)bso_108] + [3]x1[26] ≥ 0)

We simplified constraint (2123) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(2124)    ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧0 ≥ 0∧0 ≥ 0∧[284 + (-1)bso_108] ≥ 0∧[1] ≥ 0)

To summarize, we get the following constraints P_≥ for the following pairs.

7120_0_TOPOSTFIX_STORE(x0, x1, x2) → 6432_0_TOPOSTFIX_NULL(x0, x1, x2)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_56] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_56] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_56] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_56] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_56] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_56] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_56] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_56] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_56] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_56] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_56] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_56] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_56] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_56] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_56] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_56] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_56] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_56] ≥ 0)
8934_0_TOPOSTFIX_STORE(x0, java.lang.Object(LinkedList(x1, x2)), x3) → 6432_0_TOPOSTFIX_NULL(x0, java.lang.Object(LinkedList(x1, x2)), x3)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_58] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_58] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_58] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_58] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_58] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_58] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_58] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_58] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_58] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_58] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_58] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_58] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_58] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_58] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_58] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_58] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_58] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_58] ≥ 0)
8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1)), x2, x3) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1)), x2, x3)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧0 ≥ 0∧0 ≥ 0∧[3 + (-1)bso_60] ≥ 0∧[1] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧0 ≥ 0∧0 ≥ 0∧[243 + (-1)bso_60] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧0 ≥ 0∧0 ≥ 0∧[249 + (-1)bso_60] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧0 ≥ 0∧0 ≥ 0∧[255 + (-1)bso_60] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧0 ≥ 0∧0 ≥ 0∧[261 + (-1)bso_60] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧0 ≥ 0∧0 ≥ 0∧[267 + (-1)bso_60] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧0 ≥ 0∧0 ≥ 0∧[273 + (-1)bso_60] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧0 ≥ 0∧0 ≥ 0∧[279 + (-1)bso_60] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧0 ≥ 0∧0 ≥ 0∧[285 + (-1)bso_60] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧0 ≥ 0∧0 ≥ 0∧[3 + (-1)bso_60] ≥ 0∧[1] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧0 ≥ 0∧0 ≥ 0∧[267 + (-1)bso_60] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧0 ≥ 0∧0 ≥ 0∧[279 + (-1)bso_60] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧0 ≥ 0∧0 ≥ 0∧[243 + (-1)bso_60] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧0 ≥ 0∧0 ≥ 0∧[249 + (-1)bso_60] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧0 ≥ 0∧0 ≥ 0∧[255 + (-1)bso_60] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧0 ≥ 0∧0 ≥ 0∧[261 + (-1)bso_60] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧0 ≥ 0∧0 ≥ 0∧[273 + (-1)bso_60] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧0 ≥ 0∧0 ≥ 0∧[285 + (-1)bso_60] ≥ 0∧[1] ≥ 0)
8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1)), x2, x3) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1)), x2, x3)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_62] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_62] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_62] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_62] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_62] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_62] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_62] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_62] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_62] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_62] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_62] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_62] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_62] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_62] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_62] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_62] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_62] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_62] ≥ 0)
8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1)), x2, x3) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1)), x2, x3)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_64] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_64] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_64] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_64] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_64] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_64] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_64] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_64] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_64] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_64] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_64] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_64] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_64] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_64] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_64] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_64] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_64] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_64] ≥ 0)
8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1)), x2, x3) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1)), x2, x3)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_66] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_66] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_66] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_66] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_66] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_66] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_66] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_66] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_66] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_66] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_66] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_66] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_66] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_66] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_66] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_66] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_66] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_66] ≥ 0)
6432_0_TOPOSTFIX_NULL(x2, x3, java.lang.Object(LinkedList(x0, x1))) → COND_6432_0_TOPOSTFIX_NULL(<(x0, 40), x2, x3, java.lang.Object(LinkedList(x0, x1)))
- (0 ≥ 0 ⇒ (U^Increasing(COND_6432_0_TOPOSTFIX_NULL(<(x0[6], 40), x2[6], x3[6], java.lang.Object(LinkedList(x0[6], x1[6])))), ≥)∧[(4)bni_67] ≥ 0∧[(6)bni_67] ≥ 0∧0 ≥ 0∧0 ≥ 0∧[bni_67 + (-1)Bound*bni_67] ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_68] ≥ 0)
COND_6432_0_TOPOSTFIX_NULL(TRUE, x2, x3, java.lang.Object(LinkedList(x0, x1))) → 6432_0_TOPOSTFIX_NULL(x2, java.lang.Object(LinkedList(x0, x3)), x1)
- (0 ≥ 0 ⇒ (U^Increasing(6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), x1[7])), ≥)∧[(4)bni_69] ≥ 0∧[(6)bni_69] ≥ 0∧0 ≥ 0∧0 ≥ 0∧[bni_69 + (-1)Bound*bni_69] ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_70] ≥ 0∧[1] ≥ 0∧[1] ≥ 0)
- (0 ≥ 0 ⇒ (U^Increasing(6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), x1[7])), ≥)∧[(4)bni_69] ≥ 0∧[(6)bni_69] ≥ 0∧0 ≥ 0∧0 ≥ 0∧[bni_69 + (-1)Bound*bni_69] ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_70] ≥ 0∧[1] ≥ 0∧[1] ≥ 0)
6432_0_TOPOSTFIX_NULL(x2, x3, java.lang.Object(LinkedList(40, x1))) → 6432_0_TOPOSTFIX_NULL(x2, x3, x1)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧0 ≥ 0∧0 ≥ 0∧[242 + (-1)bso_72] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[242 + (-1)bso_72] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧0 ≥ 0∧0 ≥ 0∧[242 + (-1)bso_72] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧0 ≥ 0∧0 ≥ 0∧[242 + (-1)bso_72] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧0 ≥ 0∧0 ≥ 0∧[242 + (-1)bso_72] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧0 ≥ 0∧0 ≥ 0∧[242 + (-1)bso_72] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[242 + (-1)bso_72] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8]1, x3[8]1, x1[8]1)), ≥)∧0 ≥ 0∧0 ≥ 0∧[242 + (-1)bso_72] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[242 + (-1)bso_72] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧0 ≥ 0∧0 ≥ 0∧[242 + (-1)bso_72] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧0 ≥ 0∧0 ≥ 0∧[242 + (-1)bso_72] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧0 ≥ 0∧0 ≥ 0∧[242 + (-1)bso_72] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧0 ≥ 0∧0 ≥ 0∧[242 + (-1)bso_72] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧0 ≥ 0∧0 ≥ 0∧[242 + (-1)bso_72] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧0 ≥ 0∧0 ≥ 0∧[242 + (-1)bso_72] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧0 ≥ 0∧0 ≥ 0∧[242 + (-1)bso_72] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧0 ≥ 0∧0 ≥ 0∧[242 + (-1)bso_72] ≥ 0∧[1] ≥ 0)
6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2, x3)), x4, java.lang.Object(LinkedList(41, x1))) → 6432_0_TOPOSTFIX_NULL(x3, java.lang.Object(LinkedList(x2, x4)), x1)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[248 + (-1)bso_74] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[248 + (-1)bso_74] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧0 ≥ 0∧0 ≥ 0∧[248 + (-1)bso_74] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧0 ≥ 0∧0 ≥ 0∧[248 + (-1)bso_74] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧0 ≥ 0∧0 ≥ 0∧[248 + (-1)bso_74] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧0 ≥ 0∧0 ≥ 0∧[248 + (-1)bso_74] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[248 + (-1)bso_74] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[248 + (-1)bso_74] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9]1, java.lang.Object(LinkedList(x2[9]1, x4[9]1)), x1[9]1)), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[248 + (-1)bso_74] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧0 ≥ 0∧0 ≥ 0∧[248 + (-1)bso_74] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧0 ≥ 0∧0 ≥ 0∧[248 + (-1)bso_74] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[248 + (-1)bso_74] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧0 ≥ 0∧0 ≥ 0∧[248 + (-1)bso_74] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[248 + (-1)bso_74] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧0 ≥ 0∧0 ≥ 0∧[248 + (-1)bso_74] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[248 + (-1)bso_74] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[248 + (-1)bso_74] ≥ 0∧[1] ≥ 0)
6432_0_TOPOSTFIX_NULL(x2, x3, java.lang.Object(LinkedList(42, x1))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2)), x3, x1)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧0 ≥ 0∧0 ≥ 0∧[254 + (-1)bso_76] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[254 + (-1)bso_76] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧0 ≥ 0∧0 ≥ 0∧[254 + (-1)bso_76] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧0 ≥ 0∧0 ≥ 0∧[254 + (-1)bso_76] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧0 ≥ 0∧0 ≥ 0∧[254 + (-1)bso_76] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧0 ≥ 0∧0 ≥ 0∧[254 + (-1)bso_76] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[254 + (-1)bso_76] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧0 ≥ 0∧0 ≥ 0∧[254 + (-1)bso_76] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[254 + (-1)bso_76] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10]1)), x3[10]1, x1[10]1)), ≥)∧0 ≥ 0∧0 ≥ 0∧[254 + (-1)bso_76] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧0 ≥ 0∧0 ≥ 0∧[254 + (-1)bso_76] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧0 ≥ 0∧0 ≥ 0∧[254 + (-1)bso_76] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧0 ≥ 0∧0 ≥ 0∧[254 + (-1)bso_76] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧0 ≥ 0∧0 ≥ 0∧[254 + (-1)bso_76] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧0 ≥ 0∧0 ≥ 0∧[254 + (-1)bso_76] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧0 ≥ 0∧0 ≥ 0∧[254 + (-1)bso_76] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])), ≥)∧0 ≥ 0∧0 ≥ 0∧[254 + (-1)bso_76] ≥ 0∧[1] ≥ 0)
6432_0_TOPOSTFIX_NULL(x2, x3, java.lang.Object(LinkedList(43, x1))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2)), x3, x1)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧0 ≥ 0∧0 ≥ 0∧[260 + (-1)bso_78] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[260 + (-1)bso_78] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧0 ≥ 0∧0 ≥ 0∧[260 + (-1)bso_78] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧0 ≥ 0∧0 ≥ 0∧[260 + (-1)bso_78] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧0 ≥ 0∧0 ≥ 0∧[260 + (-1)bso_78] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧0 ≥ 0∧0 ≥ 0∧[260 + (-1)bso_78] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[260 + (-1)bso_78] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧0 ≥ 0∧0 ≥ 0∧[260 + (-1)bso_78] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[260 + (-1)bso_78] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧0 ≥ 0∧0 ≥ 0∧[260 + (-1)bso_78] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11]1)), x3[11]1, x1[11]1)), ≥)∧0 ≥ 0∧0 ≥ 0∧[260 + (-1)bso_78] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧0 ≥ 0∧0 ≥ 0∧[260 + (-1)bso_78] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧0 ≥ 0∧0 ≥ 0∧[260 + (-1)bso_78] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧0 ≥ 0∧0 ≥ 0∧[260 + (-1)bso_78] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧0 ≥ 0∧0 ≥ 0∧[260 + (-1)bso_78] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧0 ≥ 0∧0 ≥ 0∧[260 + (-1)bso_78] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])), ≥)∧0 ≥ 0∧0 ≥ 0∧[260 + (-1)bso_78] ≥ 0∧[1] ≥ 0)
6432_0_TOPOSTFIX_NULL(x2, x3, java.lang.Object(LinkedList(44, x1))) → 6432_0_TOPOSTFIX_NULL(x2, java.lang.Object(LinkedList(44, x3)), x1)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧0 ≥ 0∧0 ≥ 0∧[266 + (-1)bso_80] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[266 + (-1)bso_80] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧0 ≥ 0∧0 ≥ 0∧[266 + (-1)bso_80] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧0 ≥ 0∧0 ≥ 0∧[266 + (-1)bso_80] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧0 ≥ 0∧0 ≥ 0∧[266 + (-1)bso_80] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧0 ≥ 0∧0 ≥ 0∧[266 + (-1)bso_80] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[266 + (-1)bso_80] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧0 ≥ 0∧0 ≥ 0∧[266 + (-1)bso_80] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[266 + (-1)bso_80] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧0 ≥ 0∧0 ≥ 0∧[266 + (-1)bso_80] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧0 ≥ 0∧0 ≥ 0∧[266 + (-1)bso_80] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12]1, java.lang.Object(LinkedList(44, x3[12]1)), x1[12]1)), ≥)∧0 ≥ 0∧0 ≥ 0∧[266 + (-1)bso_80] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧0 ≥ 0∧0 ≥ 0∧[266 + (-1)bso_80] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧0 ≥ 0∧0 ≥ 0∧[266 + (-1)bso_80] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧0 ≥ 0∧0 ≥ 0∧[266 + (-1)bso_80] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧0 ≥ 0∧0 ≥ 0∧[266 + (-1)bso_80] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])), ≥)∧0 ≥ 0∧0 ≥ 0∧[266 + (-1)bso_80] ≥ 0∧[1] ≥ 0)
6432_0_TOPOSTFIX_NULL(x2, x3, java.lang.Object(LinkedList(45, x1))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2)), x3, x1)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧0 ≥ 0∧0 ≥ 0∧[272 + (-1)bso_82] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[272 + (-1)bso_82] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧0 ≥ 0∧0 ≥ 0∧[272 + (-1)bso_82] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧0 ≥ 0∧0 ≥ 0∧[272 + (-1)bso_82] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧0 ≥ 0∧0 ≥ 0∧[272 + (-1)bso_82] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧0 ≥ 0∧0 ≥ 0∧[272 + (-1)bso_82] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[272 + (-1)bso_82] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧0 ≥ 0∧0 ≥ 0∧[272 + (-1)bso_82] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[272 + (-1)bso_82] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧0 ≥ 0∧0 ≥ 0∧[272 + (-1)bso_82] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧0 ≥ 0∧0 ≥ 0∧[272 + (-1)bso_82] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧0 ≥ 0∧0 ≥ 0∧[272 + (-1)bso_82] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13]1)), x3[13]1, x1[13]1)), ≥)∧0 ≥ 0∧0 ≥ 0∧[272 + (-1)bso_82] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧0 ≥ 0∧0 ≥ 0∧[272 + (-1)bso_82] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧0 ≥ 0∧0 ≥ 0∧[272 + (-1)bso_82] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧0 ≥ 0∧0 ≥ 0∧[272 + (-1)bso_82] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])), ≥)∧0 ≥ 0∧0 ≥ 0∧[272 + (-1)bso_82] ≥ 0∧[1] ≥ 0)
6432_0_TOPOSTFIX_NULL(x2, x3, java.lang.Object(LinkedList(46, x1))) → 6432_0_TOPOSTFIX_NULL(x2, java.lang.Object(LinkedList(46, x3)), x1)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧0 ≥ 0∧0 ≥ 0∧[278 + (-1)bso_84] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[278 + (-1)bso_84] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧0 ≥ 0∧0 ≥ 0∧[278 + (-1)bso_84] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧0 ≥ 0∧0 ≥ 0∧[278 + (-1)bso_84] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧0 ≥ 0∧0 ≥ 0∧[278 + (-1)bso_84] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧0 ≥ 0∧0 ≥ 0∧[278 + (-1)bso_84] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[278 + (-1)bso_84] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧0 ≥ 0∧0 ≥ 0∧[278 + (-1)bso_84] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[278 + (-1)bso_84] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧0 ≥ 0∧0 ≥ 0∧[278 + (-1)bso_84] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧0 ≥ 0∧0 ≥ 0∧[278 + (-1)bso_84] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧0 ≥ 0∧0 ≥ 0∧[278 + (-1)bso_84] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧0 ≥ 0∧0 ≥ 0∧[278 + (-1)bso_84] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14]1, java.lang.Object(LinkedList(46, x3[14]1)), x1[14]1)), ≥)∧0 ≥ 0∧0 ≥ 0∧[278 + (-1)bso_84] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧0 ≥ 0∧0 ≥ 0∧[278 + (-1)bso_84] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧0 ≥ 0∧0 ≥ 0∧[278 + (-1)bso_84] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])), ≥)∧0 ≥ 0∧0 ≥ 0∧[278 + (-1)bso_84] ≥ 0∧[1] ≥ 0)
6432_0_TOPOSTFIX_NULL(x2, x3, java.lang.Object(LinkedList(47, x1))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2)), x3, x1)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧0 ≥ 0∧0 ≥ 0∧[284 + (-1)bso_86] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[284 + (-1)bso_86] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧0 ≥ 0∧0 ≥ 0∧[284 + (-1)bso_86] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧0 ≥ 0∧0 ≥ 0∧[284 + (-1)bso_86] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧0 ≥ 0∧0 ≥ 0∧[284 + (-1)bso_86] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧0 ≥ 0∧0 ≥ 0∧[284 + (-1)bso_86] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[284 + (-1)bso_86] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧0 ≥ 0∧0 ≥ 0∧[284 + (-1)bso_86] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[284 + (-1)bso_86] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧0 ≥ 0∧0 ≥ 0∧[284 + (-1)bso_86] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧0 ≥ 0∧0 ≥ 0∧[284 + (-1)bso_86] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧0 ≥ 0∧0 ≥ 0∧[284 + (-1)bso_86] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧0 ≥ 0∧0 ≥ 0∧[284 + (-1)bso_86] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧0 ≥ 0∧0 ≥ 0∧[284 + (-1)bso_86] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15]1)), x3[15]1, x1[15]1)), ≥)∧0 ≥ 0∧0 ≥ 0∧[284 + (-1)bso_86] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧0 ≥ 0∧0 ≥ 0∧[284 + (-1)bso_86] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])), ≥)∧0 ≥ 0∧0 ≥ 0∧[284 + (-1)bso_86] ≥ 0∧[1] ≥ 0)
6432_0_TOPOSTFIX_NULL(x2, x3, java.lang.Object(LinkedList(x0, x1))) → COND_6432_0_TOPOSTFIX_NULL(>(x0, 47), x2, x3, java.lang.Object(LinkedList(x0, x1)))
- (0 ≥ 0 ⇒ (U^Increasing(COND_6432_0_TOPOSTFIX_NULL(>(x0[16], 47), x2[16], x3[16], java.lang.Object(LinkedList(x0[16], x1[16])))), ≥)∧[(4)bni_87] ≥ 0∧[(6)bni_87] ≥ 0∧0 ≥ 0∧0 ≥ 0∧[bni_87 + (-1)Bound*bni_87] ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_88] ≥ 0)
6715_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(44, x1)), x2, x3) → 6432_0_TOPOSTFIX_NULL(x2, java.lang.Object(LinkedList(44, x3)), x1)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[17], java.lang.Object(LinkedList(44, x3[17])), x1[17])), ≥)∧0 ≥ 0∧0 ≥ 0∧[266 + (-1)bso_90] ≥ 0∧[1] ≥ 0)
6725_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(46, x1)), x2, x3) → 6432_0_TOPOSTFIX_NULL(x2, java.lang.Object(LinkedList(46, x3)), x1)
- ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[18], java.lang.Object(LinkedList(46, x3[18])), x1[18])), ≥)∧0 ≥ 0∧0 ≥ 0∧[278 + (-1)bso_92] ≥ 0∧[1] ≥ 0)
6432_0_TOPOSTFIX_NULL(x2, x3, java.lang.Object(LinkedList(44, x1))) → 6715_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(44, x1)), x2, x3)
- ((U^Increasing(6715_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(44, x1[19])), x2[19], x3[19])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_94] ≥ 0)
6432_0_TOPOSTFIX_NULL(x2, x3, java.lang.Object(LinkedList(46, x1))) → 6725_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(46, x1)), x2, x3)
- ((U^Increasing(6725_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(46, x1[20])), x2[20], x3[20])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_96] ≥ 0)
6432_0_TOPOSTFIX_NULL(x2, x3, java.lang.Object(LinkedList(40, x1))) → 7120_0_TOPOSTFIX_STORE(x2, x3, x1)
- ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧0 ≥ 0∧0 ≥ 0∧[240 + (-1)bso_98] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[240 + (-1)bso_98] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧0 ≥ 0∧0 ≥ 0∧[240 + (-1)bso_98] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧0 ≥ 0∧0 ≥ 0∧[240 + (-1)bso_98] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧0 ≥ 0∧0 ≥ 0∧[240 + (-1)bso_98] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧0 ≥ 0∧0 ≥ 0∧[240 + (-1)bso_98] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[240 + (-1)bso_98] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧0 ≥ 0∧0 ≥ 0∧[240 + (-1)bso_98] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[240 + (-1)bso_98] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧0 ≥ 0∧0 ≥ 0∧[240 + (-1)bso_98] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧0 ≥ 0∧0 ≥ 0∧[240 + (-1)bso_98] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧0 ≥ 0∧0 ≥ 0∧[240 + (-1)bso_98] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧0 ≥ 0∧0 ≥ 0∧[240 + (-1)bso_98] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧0 ≥ 0∧0 ≥ 0∧[240 + (-1)bso_98] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧0 ≥ 0∧0 ≥ 0∧[240 + (-1)bso_98] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧0 ≥ 0∧0 ≥ 0∧[240 + (-1)bso_98] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])), ≥)∧0 ≥ 0∧0 ≥ 0∧[240 + (-1)bso_98] ≥ 0∧[1] ≥ 0)
6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2, x3)), x4, java.lang.Object(LinkedList(41, x1))) → 8934_0_TOPOSTFIX_STORE(x3, java.lang.Object(LinkedList(x2, x4)), x1)
- ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[248 + (-1)bso_100] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[248 + (-1)bso_100] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧0 ≥ 0∧0 ≥ 0∧[248 + (-1)bso_100] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧0 ≥ 0∧0 ≥ 0∧[248 + (-1)bso_100] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧0 ≥ 0∧0 ≥ 0∧[248 + (-1)bso_100] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧0 ≥ 0∧0 ≥ 0∧[248 + (-1)bso_100] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[248 + (-1)bso_100] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[248 + (-1)bso_100] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[248 + (-1)bso_100] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧0 ≥ 0∧0 ≥ 0∧[248 + (-1)bso_100] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧0 ≥ 0∧0 ≥ 0∧[248 + (-1)bso_100] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[248 + (-1)bso_100] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧0 ≥ 0∧0 ≥ 0∧[248 + (-1)bso_100] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[248 + (-1)bso_100] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧0 ≥ 0∧0 ≥ 0∧[248 + (-1)bso_100] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[248 + (-1)bso_100] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[248 + (-1)bso_100] ≥ 0∧[1] ≥ 0)
6432_0_TOPOSTFIX_NULL(x2, x3, java.lang.Object(LinkedList(42, x1))) → 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2)), x3, x1)
- ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧0 ≥ 0∧0 ≥ 0∧[253 + (-1)bso_102] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[253 + (-1)bso_102] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧0 ≥ 0∧0 ≥ 0∧[253 + (-1)bso_102] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧0 ≥ 0∧0 ≥ 0∧[253 + (-1)bso_102] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧0 ≥ 0∧0 ≥ 0∧[253 + (-1)bso_102] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧0 ≥ 0∧0 ≥ 0∧[253 + (-1)bso_102] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[253 + (-1)bso_102] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧0 ≥ 0∧0 ≥ 0∧[253 + (-1)bso_102] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[253 + (-1)bso_102] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧0 ≥ 0∧0 ≥ 0∧[253 + (-1)bso_102] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧0 ≥ 0∧0 ≥ 0∧[253 + (-1)bso_102] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧0 ≥ 0∧0 ≥ 0∧[253 + (-1)bso_102] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧0 ≥ 0∧0 ≥ 0∧[253 + (-1)bso_102] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧0 ≥ 0∧0 ≥ 0∧[253 + (-1)bso_102] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧0 ≥ 0∧0 ≥ 0∧[253 + (-1)bso_102] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧0 ≥ 0∧0 ≥ 0∧[253 + (-1)bso_102] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])), ≥)∧0 ≥ 0∧0 ≥ 0∧[253 + (-1)bso_102] ≥ 0∧[1] ≥ 0)
6432_0_TOPOSTFIX_NULL(x2, x3, java.lang.Object(LinkedList(43, x1))) → 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2)), x3, x1)
- ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧0 ≥ 0∧0 ≥ 0∧[258 + (-1)bso_104] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[258 + (-1)bso_104] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧0 ≥ 0∧0 ≥ 0∧[258 + (-1)bso_104] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧0 ≥ 0∧0 ≥ 0∧[258 + (-1)bso_104] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧0 ≥ 0∧0 ≥ 0∧[258 + (-1)bso_104] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧0 ≥ 0∧0 ≥ 0∧[258 + (-1)bso_104] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[258 + (-1)bso_104] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧0 ≥ 0∧0 ≥ 0∧[258 + (-1)bso_104] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[258 + (-1)bso_104] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧0 ≥ 0∧0 ≥ 0∧[258 + (-1)bso_104] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧0 ≥ 0∧0 ≥ 0∧[258 + (-1)bso_104] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧0 ≥ 0∧0 ≥ 0∧[258 + (-1)bso_104] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧0 ≥ 0∧0 ≥ 0∧[258 + (-1)bso_104] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧0 ≥ 0∧0 ≥ 0∧[258 + (-1)bso_104] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧0 ≥ 0∧0 ≥ 0∧[258 + (-1)bso_104] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧0 ≥ 0∧0 ≥ 0∧[258 + (-1)bso_104] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])), ≥)∧0 ≥ 0∧0 ≥ 0∧[258 + (-1)bso_104] ≥ 0∧[1] ≥ 0)
6432_0_TOPOSTFIX_NULL(x2, x3, java.lang.Object(LinkedList(45, x1))) → 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2)), x3, x1)
- ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧0 ≥ 0∧0 ≥ 0∧[272 + (-1)bso_106] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[272 + (-1)bso_106] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧0 ≥ 0∧0 ≥ 0∧[272 + (-1)bso_106] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧0 ≥ 0∧0 ≥ 0∧[272 + (-1)bso_106] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧0 ≥ 0∧0 ≥ 0∧[272 + (-1)bso_106] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧0 ≥ 0∧0 ≥ 0∧[272 + (-1)bso_106] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[272 + (-1)bso_106] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧0 ≥ 0∧0 ≥ 0∧[272 + (-1)bso_106] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[272 + (-1)bso_106] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧0 ≥ 0∧0 ≥ 0∧[272 + (-1)bso_106] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧0 ≥ 0∧0 ≥ 0∧[272 + (-1)bso_106] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧0 ≥ 0∧0 ≥ 0∧[272 + (-1)bso_106] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧0 ≥ 0∧0 ≥ 0∧[272 + (-1)bso_106] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧0 ≥ 0∧0 ≥ 0∧[272 + (-1)bso_106] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧0 ≥ 0∧0 ≥ 0∧[272 + (-1)bso_106] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧0 ≥ 0∧0 ≥ 0∧[272 + (-1)bso_106] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])), ≥)∧0 ≥ 0∧0 ≥ 0∧[272 + (-1)bso_106] ≥ 0∧[1] ≥ 0)
6432_0_TOPOSTFIX_NULL(x2, x3, java.lang.Object(LinkedList(47, x1))) → 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2)), x3, x1)
- ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧0 ≥ 0∧0 ≥ 0∧[284 + (-1)bso_108] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[284 + (-1)bso_108] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧0 ≥ 0∧0 ≥ 0∧[284 + (-1)bso_108] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧0 ≥ 0∧0 ≥ 0∧[284 + (-1)bso_108] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧0 ≥ 0∧0 ≥ 0∧[284 + (-1)bso_108] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧0 ≥ 0∧0 ≥ 0∧[284 + (-1)bso_108] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[284 + (-1)bso_108] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧0 ≥ 0∧0 ≥ 0∧[284 + (-1)bso_108] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[284 + (-1)bso_108] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧0 ≥ 0∧0 ≥ 0∧[284 + (-1)bso_108] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧0 ≥ 0∧0 ≥ 0∧[284 + (-1)bso_108] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧0 ≥ 0∧0 ≥ 0∧[284 + (-1)bso_108] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧0 ≥ 0∧0 ≥ 0∧[284 + (-1)bso_108] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧0 ≥ 0∧0 ≥ 0∧[284 + (-1)bso_108] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧0 ≥ 0∧0 ≥ 0∧[284 + (-1)bso_108] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧0 ≥ 0∧0 ≥ 0∧[284 + (-1)bso_108] ≥ 0∧[1] ≥ 0)
- ((U^Increasing(8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])), ≥)∧0 ≥ 0∧0 ≥ 0∧[284 + (-1)bso_108] ≥ 0∧[1] ≥ 0)

The constraints for P_> respective P_bound are constructed from P_≥ where we just replace every occurence of "t ≥ s" in P_≥ by "t > s" respective "t ≥ c". Here c stands for the fresh constant used for P_bound.
Using the following integer polynomial ordering the resulting constraints can be solved
Polynomial interpretation over integers with natural coefficients for non-tuple symbols [NONINF][POLO]:

POL(TRUE) = 0
POL(FALSE) = 0
POL(6432_0_toPostfix_NULL(x₁, x₂, x₃)) = 0
POL(NULL) = 0
POL(8520_0_toPostfix_NULL(x₁)) = 0
POL(8614_0_toPostfix_Return) = 0
POL(java.lang.Object(x₁)) = [2] + [2]x₁
POL(LinkedList(x₁, x₂)) = [2]x₂ + [3]x₁
POL(7120_0_TOPOSTFIX_STORE(x₁, x₂, x₃)) = [1] + x₃
POL(6432_0_TOPOSTFIX_NULL(x₁, x₂, x₃)) = [-1] + x₃
POL(8934_0_TOPOSTFIX_STORE(x₁, x₂, x₃)) = [-1] + x₃
POL(8508_0_TOPOSTFIX_STORE(x₁, x₂, x₃)) = [2]x₃
POL(42) = 0
POL(8511_0_TOPOSTFIX_STORE(x₁, x₂, x₃)) = [1] + x₃
POL(43) = 0
POL(8514_0_TOPOSTFIX_STORE(x₁, x₂, x₃)) = [-1] + x₃
POL(45) = 0
POL(8517_0_TOPOSTFIX_STORE(x₁, x₂, x₃)) = [-1] + x₃
POL(47) = 0
POL(COND_6432_0_TOPOSTFIX_NULL(x₁, x₂, x₃, x₄)) = [-1] + x₄
POL(<(x₁, x₂)) = 0
POL(40) = 0
POL(41) = 0
POL(44) = 0
POL(46) = 0
POL(>(x₁, x₂)) = 0
POL(6715_0_TOPOSTFIX_NEW(x₁, x₂, x₃)) = [-1] + x₁
POL(6725_0_TOPOSTFIX_NEW(x₁, x₂, x₃)) = [-1] + x₁

The following pairs are in P_>:

7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0]) → 6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])
8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])
8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])
COND_6432_0_TOPOSTFIX_NULL(TRUE, x2[7], x3[7], java.lang.Object(LinkedList(x0[7], x1[7]))) → 6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), x1[7])
6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8]))) → 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])
6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9]))) → 6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])
6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])
6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])
6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12]))) → 6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])
6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])
6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14]))) → 6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])
6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])
6715_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(44, x1[17])), x2[17], x3[17]) → 6432_0_TOPOSTFIX_NULL(x2[17], java.lang.Object(LinkedList(44, x3[17])), x1[17])
6725_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(46, x1[18])), x2[18], x3[18]) → 6432_0_TOPOSTFIX_NULL(x2[18], java.lang.Object(LinkedList(46, x3[18])), x1[18])
6432_0_TOPOSTFIX_NULL(x2[21], x3[21], java.lang.Object(LinkedList(40, x1[21]))) → 7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])
6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x4[22], java.lang.Object(LinkedList(41, x1[22]))) → 8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])
6432_0_TOPOSTFIX_NULL(x2[23], x3[23], java.lang.Object(LinkedList(42, x1[23]))) → 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])
6432_0_TOPOSTFIX_NULL(x2[24], x3[24], java.lang.Object(LinkedList(43, x1[24]))) → 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])
6432_0_TOPOSTFIX_NULL(x2[25], x3[25], java.lang.Object(LinkedList(45, x1[25]))) → 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])
6432_0_TOPOSTFIX_NULL(x2[26], x3[26], java.lang.Object(LinkedList(47, x1[26]))) → 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])

The following pairs are in P_bound:

6432_0_TOPOSTFIX_NULL(x2[6], x3[6], java.lang.Object(LinkedList(x0[6], x1[6]))) → COND_6432_0_TOPOSTFIX_NULL(<(x0[6], 40), x2[6], x3[6], java.lang.Object(LinkedList(x0[6], x1[6])))
COND_6432_0_TOPOSTFIX_NULL(TRUE, x2[7], x3[7], java.lang.Object(LinkedList(x0[7], x1[7]))) → 6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), x1[7])
6432_0_TOPOSTFIX_NULL(x2[16], x3[16], java.lang.Object(LinkedList(x0[16], x1[16]))) → COND_6432_0_TOPOSTFIX_NULL(>(x0[16], 47), x2[16], x3[16], java.lang.Object(LinkedList(x0[16], x1[16])))

The following pairs are in P_≥:

8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]) → 6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])
8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])
8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])
6432_0_TOPOSTFIX_NULL(x2[6], x3[6], java.lang.Object(LinkedList(x0[6], x1[6]))) → COND_6432_0_TOPOSTFIX_NULL(<(x0[6], 40), x2[6], x3[6], java.lang.Object(LinkedList(x0[6], x1[6])))
6432_0_TOPOSTFIX_NULL(x2[16], x3[16], java.lang.Object(LinkedList(x0[16], x1[16]))) → COND_6432_0_TOPOSTFIX_NULL(>(x0[16], 47), x2[16], x3[16], java.lang.Object(LinkedList(x0[16], x1[16])))
6432_0_TOPOSTFIX_NULL(x2[19], x3[19], java.lang.Object(LinkedList(44, x1[19]))) → 6715_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(44, x1[19])), x2[19], x3[19])
6432_0_TOPOSTFIX_NULL(x2[20], x3[20], java.lang.Object(LinkedList(46, x1[20]))) → 6725_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(46, x1[20])), x2[20], x3[20])

There are no usable rules.

(16) Complex Obligation (AND)

(17) Obligation:

IDP problem:
The following function symbols are pre-defined:

!=	~	Neq: (Integer, Integer) -> Boolean
*	~	Mul: (Integer, Integer) -> Integer
>=	~	Ge: (Integer, Integer) -> Boolean
-1	~	UnaryMinus: (Integer) -> Integer
\|	~	Bwor: (Integer, Integer) -> Integer
/	~	Div: (Integer, Integer) -> Integer
=	~	Eq: (Integer, Integer) -> Boolean
	~	Bwxor: (Integer, Integer) -> Integer
\|\|	~	Lor: (Boolean, Boolean) -> Boolean
!	~	Lnot: (Boolean) -> Boolean
<	~	Lt: (Integer, Integer) -> Boolean
-	~	Sub: (Integer, Integer) -> Integer
<=	~	Le: (Integer, Integer) -> Boolean
>	~	Gt: (Integer, Integer) -> Boolean
~	~	Bwnot: (Integer) -> Integer
%	~	Mod: (Integer, Integer) -> Integer
&	~	Bwand: (Integer, Integer) -> Integer
+	~	Add: (Integer, Integer) -> Integer
&&	~	Land: (Boolean, Boolean) -> Boolean